On 3-colorable planar graphs without cycles of four lengths
From MaRDI portal
Publication:2379960
DOI10.1016/J.IPL.2007.03.007zbMATH Open1185.05061OpenAlexW2076057198MaRDI QIDQ2379960FDOQ2379960
Authors: Xiao Fang Luo, Min Chen, Weifan Wang 
Publication date: 24 March 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2007.03.007
Recommendations
- On 3-colorable planar graphs without short cycles
- 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
- The 3-colorability of planar graphs without cycles of length 4, 6 and 9
- Three-coloring planar graphs without short cycles
- On the 3-colorability of planar graphs without \(\{4,8,9\}\)-cycles
- On 3-colorability of planar graphs without adjacent short cycles
- Planar graphs without cycles of length from 4 to 7 are 3-colorable
- Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)
Cites Work
- 25 pretty graph colouring problems
- Title not available (Why is that?)
- On 3-colorable plane graphs without 5- and 7-cycles
- Three-coloring planar graphs without short 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
- A note on 3-choosability of planar graphs without certain cycles
Cited In (18)
- A note on 3-choosability of planar graphs without certain cycles
- Title not available (Why is that?)
- Planar graphs without 4, 6, 8-cycles are 3-colorable
- On the 3-colorability of planar graphs without \(\{4,8,9\}\)-cycles
- Planar graphs without normally adjacent short cycles
- On 3-colorable plane graphs without 5- and 7-cycles
- Three-colourability of planar graphs with no 5- or triangular \(\{3,6\}\)-cycles
- Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles
- The 3-colorability of planar graphs without cycles of length 4, 6 and 9
- Three-coloring planar graphs without short cycles
- On the 3-colorability of planar graphs without 4-, 7- and 9-cycles
- Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph
- Cycle adjacency of planar graphs and 3-colourability
- Every signed planar graph without cycles of length from 4 to 8 is 3-colorable
- A step towards the strong version of Havel's three color conjecture
- Plane graphs without cycles of length 4, 6, 7 or 8 are 3-colorable
- Short proofs of coloring theorems on planar graphs
- Planar graphs without cycles of length from 4 to 7 are 3-colorable
This page was built for publication: On 3-colorable planar graphs without cycles of four lengths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2379960)
