On 3-colorable plane graphs without 5- and 7-cycles

DOI10.1016/J.JCTB.2006.02.005zbMATH Open1108.05046OpenAlexW2784761478MaRDI QIDQ859619FDOQ859619

Baogang Xu

Publication date: 16 January 2007

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

Full work available at URL: https://doi.org/10.1016/j.jctb.2006.02.005

Recommendations

• A NOTE ON 3-COLORABLE PLANE GRAPHS WITHOUT 5- AND 7-CYCLES
• Plane graphs without 4- and 5-cycles and without ext-triangular 7-cycles are 3-colorable
• Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable
• On 3-colorable planar graphs without prescribed cycles
• On the 3-colorability of planar graphs without 4-, 7- and 9-cycles
• The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles
• A note on the three color problem on planar graphs without 4- and 5-cycles and without ext-triangular 7-cycles
• On 3-colorable planar graphs without short cycles
• A 3-color theorem on plane graphs without 5-circuits
• On 3-colorable planar graphs without cycles of four lengths

zbMATH Keywords

coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Cites Work

• Title not available (Why is that?)
• A sufficient condition for planar graphs to be 3-colorable
• Planar graphs without cycles of length from 4 to 7 are 3-colorable
• A 3-color theorem on plane graphs without 5-circuits

Cited In (26)

• Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable
• Title not available (Why is that?)
• Planar graphs without 4, 6, 8-cycles are 3-colorable
• Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle.
• Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable
• A NOTE ON 3-COLORABLE PLANE GRAPHS WITHOUT 5- AND 7-CYCLES
• Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs
• Circular coloring and fractional coloring in planar graphs
• Three-colourability of planar graphs with no 5- or triangular \(\{3,6\}\)-cycles
• The 3-colorability of planar graphs without cycles of length 4, 6 and 9
• A sufficient condition on 3-colorable plane graphs without 5- and 6-circuits
• Three-coloring planar graphs without short cycles
• Steinberg's conjecture is false
• On 3-colorable planar graphs without short cycles
• On the 3-colorability of planar graphs without 4-, 7- and 9-cycles
• Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable
• A step towards the strong version of Havel's three color conjecture
• \((1,0,0)\)-colorability of planar graphs without prescribed short cycles
• A structural theorem on embedded graphs and its application to colorings
• Plane graphs without cycles of length 4, 6, 7 or 8 are 3-colorable
• Title not available (Why is that?)
• Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable
• Short proofs of coloring theorems on planar graphs
• On 3-colorable planar graphs without cycles of four lengths
• A 3-color theorem on plane graphs without 5-circuits
• On 3-colorable planar graphs without prescribed cycles

This page was built for publication: On 3-colorable plane graphs without 5- and 7-cycles

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