The 3-colorability of planar graphs without cycles of length 4, 6 and 9
From MaRDI portal
Publication:501066
DOI10.1016/J.DISC.2015.08.023zbMATH Open1322.05043arXiv1506.04629OpenAlexW1593750691MaRDI QIDQ501066FDOQ501066
Authors: Yingli Kang, Li-Gang Jin, Yingqian Wang 
Publication date: 8 October 2015
Published in: Discrete Mathematics (Search for Journal in Brave)
Abstract: In this paper, we prove that planar graphs without cycles of length 4, 6, 9 are 3-colorable.
Full work available at URL: https://arxiv.org/abs/1506.04629
Recommendations
- On the 3-colorability of planar graphs without 4-, 7- and 9-cycles
- On the 3-colorability of planar graphs without \(\{4,8,9\}\)-cycles
- On 3-colorable planar graphs without cycles of four lengths
- Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable
- \((1,0,0)\)-colorability of planar graphs without cycles of length 4, 5 or 9
- The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles
- DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from \(\{6,7,8\}\)
- Three-colourability of planar graphs with no 5- or triangular \(\{3,6\}\)-cycles
- Planar graphs without cycles of length 4 or 9 are $\boldsymbol{(2,~0,~0)}$-colorable
- Planar graphs without 4, 6, 8-cycles are 3-colorable
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)
Cites Work
- Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable
- Title not available (Why is that?)
- On 3-colorable plane graphs without 5- and 7-cycles
- On the 3-colorability of planar graphs without 4-, 7- and 9-cycles
- Planar graphs without cycles of length from 4 to 7 are 3-colorable
- A note on the three color problem
- Title not available (Why is that?)
- Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
- Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable
- Planar graphs without 4, 6, 8-cycles are 3-colorable
- A NOTE ON 3-COLORABLE PLANE GRAPHS WITHOUT 5- AND 7-CYCLES
Cited In (12)
- Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition
- On the 3-colorability of planar graphs without \(\{4,8,9\}\)-cycles
- A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles
- Planar graphs having no cycle of length 4, 7, or 9 are DP-3-colorable
- Three-colourability of planar graphs with no 5- or triangular \(\{3,6\}\)-cycles
- Plane graphs without 4- and 5-cycles and without ext-triangular 7-cycles are 3-colorable
- Planar graphs without short even cycles are near-bipartite
- Planar graphs without cycles of length 4 or 9 are $\boldsymbol{(2,~0,~0)}$-colorable
- \((1,0,0)\)-colorability of planar graphs without prescribed short cycles
- \((1,0,0)\)-colorability of planar graphs without cycles of length \(4\) or \(6\)
- Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable
- On 3-colorable planar graphs without cycles of four lengths
This page was built for publication: The 3-colorability of planar graphs without cycles of length 4, 6 and 9
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q501066)
