Cycle adjacency of planar graphs and 3-colourability

DOI10.11650/TWJM/1500406365zbMATH Open1235.05055OpenAlexW1837982060MaRDI QIDQ647258FDOQ647258

Authors: Chung-Ying Yang, Xuding Zhu 

Publication date: 1 December 2011

Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.11650/twjm/1500406365

Recommendations

• On 3-colorable planar graphs without short cycles
• On 3-colorable planar graphs without prescribed cycles
• Cyclic chromatic number of 3-connected plane graphs
• The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles
• On vertex types and cyclic colourings of 3-connected plane graphs
• Three-colourability of planar graphs with no 5- or triangular \(\{3,6\}\)-cycles
• On 3-colorable planar graphs without cycles of four lengths
• Acyclically 3-colorable planar graphs
• Acyclically 3-colorable planar graphs

zbMATH Keywords

planar graphnumbercycle adjacency

Mathematics Subject Classification ID

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

Cited In (1)

• Acyclically 3-colorable planar graphs

This page was built for publication: Cycle adjacency of planar graphs and 3-colourability

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