A Sufficient Condition for Planar Graphs of Maximum Degree 6 to be Totally 7-Colorable

Enqiang Zhu and Yongsheng Rao

Discrete Dynamics in Nature and Society, 2020, vol. 2020, 1-8

Abstract:

A total - coloring of a graph is an assignment of colors to its vertices and edges such that no two adjacent or incident elements receive the same color. The total coloring conjecture (TCC) states that every simple graph has a total - coloring, where is the maximum degree of . This conjecture has been confirmed for planar graphs with maximum degree at least 7 or at most 5, i.e., the only open case of TCC is that of maximum degree 6. It is known that every planar graph of or with some restrictions has a total - coloring. In particular, in (Shen and Wang, 2009), the authors proved that every planar graph with maximum degree 6 and without 4-cycles has a total 7-coloring. In this paper, we improve this result by showing that every diamond-free and house-free planar graph of maximum degree 6 is totally 7-colorable if every 6-vertex is not incident with two adjacent four cycles or three cycles of size for some .

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/DDNS/2020/3196540.pdf (application/pdf)
http://downloads.hindawi.com/journals/DDNS/2020/3196540.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnddns:3196540

DOI: 10.1155/2020/3196540

Access Statistics for this article

More articles in Discrete Dynamics in Nature and Society from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().