Total coloring of claw-free planar graphs (Q2151210)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Total coloring of claw-free planar graphs |
scientific article |
Statements
Total coloring of claw-free planar graphs (English)
0 references
1 July 2022
0 references
The total coloring conjecture (TCC) is an important conjecture in the field of graph coloring, which has been widely studied in the literature. So far TCC has been confirmed for graphs with \(\Delta\leq 5\) and for planar graphs with \(\Delta\geq 7\). Therefore, the only open case for planar graphs is \(\Delta=6\). In this paper, the author proves that TCC holds for claw-free planar graphs with \(\Delta=6\). In my opinion, the result is meaningful and interesting, which partially supports the correctness of TCC.
0 references
total coloring conjecture
0 references
planar graphs
0 references
claw
0 references
0 references