caa a22 4500 605461473 CHVBK 20210128100243.0 cr unu---uuuuu 210128e20151201xx s 000 0 eng 10.1007/s10114-015-4337-y doi (NATIONALLICENCE)springer-10.1007/s10114-015-4337-y Cai Hua School of Mathematics, Shandong University, 250100, Jinan, P. R. China aut Total coloring of planar graphs without chordal 7-cycles [Elektronische Daten] [Hua Cai] A k-total-coloring of a graph G is a coloring of vertices and edges of G using k colors such that no two adjacent or incident elements receive the same color. In this paper, it is proved that if G is a planar graph with Δ(G) ≥ 7 and without chordal 7-cycles, then G has a (Δ(G)+1)-total-coloring. Institute of Mathematics, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Chinese Mathematical Society and Springer-Verlag Berlin Heidelberg, 2015 Planar graph nationallicence total coloring nationallicence chordal 7-cycle nationallicence Acta Mathematica Sinica, English Series Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society 31/12(2015-12-01), 1951-1962 1439-8516 31:12<1951 2015 31 10114 https://doi.org/10.1007/s10114-015-4337-y text/html Onlinezugriff via DOI BK010053 XK010053 XK010000 Metadata rights reserved Springer special CC-BY-NC licence nationallicence 1 research-article jats NATIONALLICENCE NATIONALLICENCE NL-springer NATIONALLICENCE 856 40 https://doi.org/10.1007/s10114-015-4337-y text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Cai Hua School of Mathematics, Shandong University, 250100, Jinan, P. R. China aut NATIONALLICENCE 773 0- Acta Mathematica Sinica, English Series Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society 31/12(2015-12-01), 1951-1962 1439-8516 31:12<1951 2015 31 10114