Total colorings of planar graphs without chordal 6-cycles

DOI10.1016/J.DAM.2014.02.004MaRDI QIDQ2449112zbMATH OpenOpenAlexFDO

Authors Bing Wang, Jian-Liang Wu, Huijuan Wang

Publication date 6 May 2014

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2014.02.004

zbMATH Keywords

chordscycleplanar graphtotal coloring

Mathematics Subject Classification ID

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

Recommendations

• Total coloring of planar graphs without some chordal 6-cycles
• Total coloring of planar graphs without chordal 7-cycles
• Total coloring of planar graphs without 6-cycles
• Total coloring of planar graphs without short cycles
• Total colorings of planar graphs without 5-cycles and adjacent 6-cycles

Cites work

• A note on total colorings of planar graphs without 4-cycles
• Graph theory with applications
• scientific article; zbMATH DE number 3284071 (Why is no real title available?)
• List edge and list total colourings of multigraphs
• 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
• Plane graphs with maximum degree 7 and without 5-cycles with chords are 8-totally-colorable
• The total chromatic number of any multigraph with maximum degree five is at most seven
• Total chromatic number of planar graphs with maximum degree ten
• Total colorings and list total colorings of planar graphs without intersecting 4-cycles
• Total colorings of planar graphs with large maximum degree
• Total colorings of planar graphs with maximum degree at least 8
• Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles
• Total colourings of graphs
• Total-Coloring of Plane Graphs with Maximum Degree Nine

Cited in

(24)

• Total coloring of outer-1-planar graphs with near-independent crossings
• Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable
• \((\Delta +1)\)-total-colorability of plane graphs of maximum degree \(\Delta\geq 6\) with neither chordal \(5\)-cycle nor chordal \(6\)-cycle
• A sufficient condition for planar graphs of maximum degree 6 to be totally 7-colorable
• Total coloring of planar graphs without some chordal 6-cycles
• Total coloring of planar graphs without adjacent chordal 6-cycles
• Total coloring of planar graphs without chordal 7-cycles
• Total colorings of planar graphs with maximum degree at least 7 and without adjacent 5-cycles
• Total coloring of planar graphs without short cycles
• Total coloring of planar graphs without 7-cycles with chords
• Total coloring of planar graphs with 7-cycles containing at most two chords
• Total coloring of planar graphs with maximum degree seven
• A note on total colorings of planar graphs without 4-cycles
• Total chromatic number of planar graphs with few short cycles
• Total coloring of planar graphs without chordal short cycles
• A 6-chromatic odd-distance graph in the plane
• Total colorings of planar graphs with sparse short cycles
• Total coloring of planar graphs without adjacent short cycles
• A totally \((\Delta + 1)\)-colorable 1-planar graph with girth at least five
• Total colorings of planar graphs with maximum degree 6 and without adjacent chordal 6-cycles
• Total colorings-a survey
• Total coloring of planar graphs without 6-cycles
• A larger family of planar graphs that satisfy the total coloring conjecture
• Total colorings of planar graphs without small cycles

This page was built for publication: Total colorings of planar graphs without chordal 6-cycles

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