Pages that link to "Item:Q2488930"
From MaRDI portal
The following pages link to Bordeaux 3-color conjecture and 3-choosability (Q2488930):
Displayed 11 items.
- On 3-choosability of planar graphs without certain cycles (Q963411) (← links)
- A relaxation of Havel's 3-color problem (Q963412) (← links)
- A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable (Q975410) (← links)
- On 3-choosable planar graphs of girth at least 4 (Q1025501) (← links)
- Planar graphs without 3-, 7-, and 8-cycles are 3-choosable (Q1045077) (← links)
- Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable (Q1045155) (← links)
- Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable (Q2319718) (← links)
- A sufficient condition for a planar graph to be 3-choosable (Q2380013) (← links)
- A note on 3-choosability of planar graphs (Q2380076) (← links)
- A note on 3-choosability of plane graphs under distance restrictions (Q2966511) (← links)
- The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs (Q5048297) (← links)