Bordeaux 3-color conjecture and 3-choosability
From MaRDI portal
Publication:2488930
DOI10.1016/j.disc.2006.02.001zbMath1090.05029OpenAlexW2013753928WikidataQ122984359 ScholiaQ122984359MaRDI QIDQ2488930
Mickaël Montassier, Wei Fan Wang, Andre Raspaud
Publication date: 16 May 2006
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.02.001
Related Items
The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs ⋮ A sufficient condition for a planar graph to be 3-choosable ⋮ A note on 3-choosability of planar graphs ⋮ A note on 3-choosability of plane graphs under distance restrictions ⋮ On 3-choosability of planar graphs without certain cycles ⋮ A relaxation of Havel's 3-color problem ⋮ A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable ⋮ On 3-choosable planar graphs of girth at least 4 ⋮ Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable ⋮ Planar graphs without 3-, 7-, and 8-cycles are 3-choosable ⋮ Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable
Cites Work
- Unnamed Item
- List colourings of planar graphs
- A non-3-choosable planar graph without cycles of length 4 and 5
- The complexity of planar graph choosability
- Colorings and orientations of graphs
- The 4-choosability of plane graphs without 4-cycles
- Every planar graph is 5-choosable
- A sufficient condition for planar graphs to be 3-colorable
- Choosability and edge choosability of planar graphs without five cycles
- The 3-choosability of plane graphs of girth 4
- On structure of some plane graphs with application to choosability
- 3-list-coloring planar graphs of girth 5
- A not 3-choosable planar graph without 3-cycles
- A note on 3-choosability of planar graphs without certain cycles
- Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
- On a conjecture of B. Grünbaum
