Total colorings of planar graphs with sparse triangles

DOI10.1016/J.TCS.2014.01.022MaRDI QIDQ2437770zbMATH OpenOpenAlexFDO

Authors Jian Chang, Yong-Ga A, Jian-Liang Wu

Publication date 13 March 2014

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

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

zbMATH Keywords

cycleplanar graphtotal chromatic numbertotal coloring

Mathematics Subject Classification ID

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

Recommendations

• Total colorings of planar graphs without adjacent 5-cycles.
• Total coloring of planar graphs without short cycles
• A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable
• Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
• Total colorings of planar graphs without adjacent triangles

Cites work

• Graph theory with applications
• scientific article; zbMATH DE number 3284071 (Why is no real title available?)
• Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
• On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles
• On the total coloring of planar graphs.
• On total 9-coloring planar graphs of maximum degree seven
• Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
• Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable
• The total chromatic number of any multigraph with maximum degree five is at most seven
• Total colorings of planar graphs with large maximum degree
• Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords
• Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles
• Total colorings of planar graphs without intersecting 5-cycles
• Total-Coloring of Plane Graphs with Maximum Degree Nine

Cited in

(5)

• Colouring of generalized signed triangle-free planar graphs
• Triangle-free planar graphs with at most \(64^{n^{0.731}}\) 3-colorings
• The number of colorings of planar graphs with no separating triangles
• Total colorings-a survey
• Total colorings of planar graphs without adjacent triangles

This page was built for publication: Total colorings of planar graphs with sparse triangles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2437770)