Total coloring of planar graphs without short cycles
From MaRDI portal
Publication:281812
DOI10.1007/S10878-015-9859-9zbMATH Open1339.05068OpenAlexW1993619765MaRDI QIDQ281812FDOQ281812
Jian-Liang Wu, Hua Cai, Lin Sun
Publication date: 11 May 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-015-9859-9
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)
Cites Work
- Total colorings and list total colorings of planar graphs without intersecting 4-cycles
- Minimum total coloring of planar graph
- On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles
- The total chromatic number of any multigraph with maximum degree five is at most seven
- Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords
- Total colorings of planar graphs without chordal 6-cycles
- Total-Coloring of Plane Graphs with Maximum Degree Nine
- On the total coloring of planar graphs.
- Total coloring of planar graphs with maximum degree 8
- On total 9-coloring planar graphs of maximum degree seven
- A note on the total coloring of planar graphs without adjacent 4-cycles
- Total colorings of planar graphs with large maximum degree
- Total colorings of planar graphs without intersecting 5-cycles
- Plane graphs with maximum degree 7 and without 5-cycles with chords are 8-totally-colorable
- Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
- Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable
- A larger family of planar graphs that satisfy the total coloring conjecture
- Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
- Local condition for planar graphs of maximum degree 6 to be total 8-colorable
- Total coloring of planar graphs of maximum degree eight
Cited In (8)
- Total colorings-a survey
- Total coloring of planar graphs without chordal short cycles
- Three-coloring planar graphs without short cycles
- Planar graph colorings without short monochromatic cycles
- Total coloring of planar graphs without adjacent chordal 6-cycles
- Incidence coloring of planar graphs without adjacent small cycles
- Title not available (Why is that?)
- Short proofs of coloring theorems on planar graphs
This page was built for publication: Total coloring of planar graphs without short cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q281812)
