Planar graphs without intersecting 5-cycles are 4-choosable
From MaRDI portal
Publication:2397522
DOI10.1016/J.DISC.2017.03.012zbMATH Open1362.05036OpenAlexW2606668412MaRDI QIDQ2397522FDOQ2397522
Authors: Dai-Qiang Hu, Jian-Liang Wu 
Publication date: 22 May 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2017.03.012
Recommendations
- Planar graphs without chordal 6-cycles are 4-choosable
- The 4-choosability of plane graphs without 4-cycles
- Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable
- The 4-choosability of planar graphs without 6-cycles
- A new sufficient condition for a toroidal graph to be 4-choosable
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)
Cites Work
- Graph theory
- Title not available (Why is that?)
- Every planar graph is 5-choosable
- Title not available (Why is that?)
- Colorings and orientations of graphs
- List colourings of planar graphs
- Choosability and edge choosability of planar graphs without five cycles
- Planar Graphs without 7-Cycles Are 4-Choosable
- The 4-choosability of plane graphs without 4-cycles
- Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
- Planar graphs without cycles of specific lengths
- A not 3-choosable planar graph without 3-cycles
- Planar graphs without 4-cycles adjacent to triangles are 4-choosable
- On structure of some plane graphs with application to choosability
Cited In (15)
- Planar Graphs without 7-Cycles Are 4-Choosable
- A sufficient condition for planar graphs to be DP-4-colorable
- Planar graphs without intersecting 5-cycles are signed-4-choosable
- The 4-choosability of planar graphs without 6-cycles
- 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz
- On \((3, r)\)-choosability of some planar graphs
- A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable
- Planar graphs without chordal 5-cycles are 2-good
- DP-4-coloring of planar graphs with some restrictions on cycles
- Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable
- DP-4-colorability of planar graphs without adjacent cycles of given length
- On 3-choosable planar graphs of girth at least 4
- DP-\(4\)-colorability of planar graphs without intersecting \(5\)-cycles
- Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
- List coloring and diagonal coloring for plane graphs of diameter two
This page was built for publication: Planar graphs without intersecting 5-cycles are 4-choosable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397522)
