Total colorings of planar graphs without small cycles
From MaRDI portal
Publication:937252
DOI10.1007/s00373-008-0778-8zbMath1155.05025MaRDI QIDQ937252
Mei Lan, Yan Zhu, Jian Liang Wu, Jian-Feng Hou, Gui Zhen Liu
Publication date: 20 August 2008
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-008-0778-8
05C35: Extremal problems in graph theory
05C10: Planar graphs; geometric and topological aspects of graph theory
05C15: Coloring of graphs and hypergraphs
Related Items
Total coloring of planar graphs with maximum degree 8, \((\Delta + 1)\)-total-colorability of plane graphs with maximum degree \(\Delta\) at least 6 and without adjacent short cycles, On the total choosability of planar graphs and of sparse graphs, A totally \((\Delta + 1)\)-colorable 1-planar graph with girth at least five, Local condition for planar graphs of maximum degree 7 to be 8-totally colorable, Total coloring of planar graphs without 6-cycles, Total coloring of embedded graphs of maximum degree at least ten, Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable, Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable, Total coloring of planar graphs of maximum degree eight, Total colorings of planar graphs with maximum degree at least 8, On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles, Total colorings and list total colorings of planar graphs without intersecting 4-cycles, List-edge-coloring of planar graphs without 6-cycles with three chords, Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable, Total coloring of planar graphs without some chordal 6-cycles, List edge coloring of planar graphs without non-induced 6-cycles, A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- List edge and list total colorings of planar graphs without 4-cycles
- Determining the total colouring number is NP-hard
- The total coloring of a multigraph with maximal degree 4
- The total chromatic number of any multigraph with maximum degree five is at most seven
- Total colourings of planar graphs with large girth
- On the total coloring of certain graphs
- On the total coloring of planar graphs.
- A note on total colorings of planar graphs without 4-cycles
- On Total Chromatic Number of a Graph
