Total colorings-a survey
| Autor: | Jayabalan Geetha, Narayanan Narayanan, Kanagasabapathi Somasundaram |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2023 |
| Předmět: | |
| Zdroj: | AKCE International Journal of Graphs and Combinatorics, Vol 20, Iss 3, Pp 339-351 (2023) |
| Druh dokumentu: | article |
| ISSN: | 09728600 2543-3474 0972-8600 |
| DOI: | 10.1080/09728600.2023.2187960 |
| Popis: | AbstractThe smallest integer k needed for the assignment of k colors to the elements so that the coloring is proper (vertices and edges) is called the total chromatic number of a graph. Vizing [126] and Behzad [6, 7] conjectured that the total coloring can be done using at most [Formula: see text] colors, where [Formula: see text] is the maximum degree of G. It is not settled even for planar graphs. In this paper, we give a survey on the total coloring of graphs. |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|