Planar graphs without 5-cycles or without 6-cycles

DOI10.1016/j.disc.2008.07.033zbMath1186.05043WikidataQ62838274 ScholiaQ62838274MaRDI QIDQ1025913

Xiao Yu, Qin Ma, Jian Liang Wu

Publication date: 23 June 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2008.07.033

zbMATH Keywords

planarity; list total chromatic number; arboricity; discharging; list colorings; list edge chromatic number; linear k-arboricity

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C10: Planar graphs; geometric and topological aspects of graph theory

05C15: Coloring of graphs and hypergraphs

Related Items

On the linear 2-arboricity of planar graph without normally adjacent 3-cycles and 4-cycles, The linear 2-arboricity of sparse graphs, An improved upper bound on the linear 2-arboricity of planar graphs, Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable, Linear 2-arboricity of toroidal graphs, Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable, A structural theorem for planar graphs with some applications, Light structures in 1-planar graphs with an application to linear 2-arboricity, On group choosability of total graphs, Linear 2-arboricity of planar graphs with neither 3-cycles nor adjacent 4-cycles

Cites Work

• On linear k-arboricity
• List edge and list total colorings of planar graphs without 4-cycles
• Some problems about linear arboricity
• Algorithmic aspects of linear \(k\)-arboricity
• Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5
• On the linear \(k\)-arboricity of cubic graphs
• List edge and list total colourings of multigraphs
• The linear 2-arboricity of planar graphs
• Linear \(k\)-arboricities on trees
• List Total Colourings of Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item