On structure of some plane graphs with application to choosability

DOI10.1006/jctb.2001.2038zbMath1024.05049MaRDI QIDQ1850547

Peter Che Bor Lam, Wai Chee Shiu, Bao-Gang Xu

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.2001.2038

zbMATH Keywords

triangle; cycle

Mathematics Subject Classification ID

05C38: Paths and cycles

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

05C75: Structural characterization of families of graphs

Related Items

Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable, List edge and list total colorings of planar graphs without 4-cycles, A non-3-choosable planar graph without cycles of length 4 and 5, On 3-choosability of planar graphs without certain cycles, On 3-choosable planar graphs of girth at least 4, A structural theorem on embedded graphs and its application to colorings, On 3-choosability of plane graphs without 6-, 7- and 9-cycles, Bordeaux 3-color conjecture and 3-choosability, Choosability of toroidal graphs without short cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some results on \((a:b)\)-choosability
• The complexity of planar graph choosability
• Colorings and orientations of graphs
• The 4-choosability of plane graphs without 4-cycles
• Every planar graph is 5-choosable
• Choosability and fractional chromatic numbers
• The list chromatic index of a bipartite multigraph
• 3-list-coloring planar graphs of girth 5