Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords

DOI10.1016/j.tcs.2013.01.015zbMath1261.05023OpenAlexW2086272539MaRDI QIDQ1945929

Jian Chang, Yong-Ga A, Hui-Juan Wang, Jian Liang Wu

Publication date: 17 April 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.01.015

zbMATH Keywords

cycleplanar graphtotal coloring

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items (12)

Total coloring of planar graphs without chordal 7-cycles ⋮ Total coloring of planar graphs without short cycles ⋮ A note on the minimum total coloring of planar graphs ⋮ Total coloring of planar graphs with 7-cycles containing at most two chords ⋮ Total coloring of planar graphs with maximum degree 8 ⋮ Total colorings of \(F_5\)-free planar graphs with maximum degree 8 ⋮ Total coloring of planar graphs without some adjacent cycles ⋮ Total colorings-a survey ⋮ Minimum total coloring of planar graphs with maximum degree 8 ⋮ Total colorings of planar graphs with sparse triangles ⋮ Minimum total coloring of planar graph ⋮ Total coloring of planar graphs without chordal short cycles

This page was built for publication: Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords