Pages that link to "Item:Q1903746"
From MaRDI portal
The following pages link to A not 3-choosable planar graph without 3-cycles (Q1903746):
Displaying 19 items.
- 3-choosability of planar graphs with \((\leqslant 4)\)-cycles far apart (Q2434715) (← links)
- Bordeaux 3-color conjecture and 3-choosability (Q2488930) (← links)
- 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz (Q2685332) (← links)
- On choosability with separation of planar graphs with forbidden cycles (Q2800544) (← links)
- A note on 3-choosability of plane graphs under distance restrictions (Q2966511) (← links)
- Choosability of toroidal graphs without short cycles (Q3055923) (← links)
- On 3-colorable non-4-choosable planar graphs (Q3122897) (← links)
- Adapted list coloring of planar graphs (Q3652546) (← links)
- Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count (Q4625139) (← links)
- Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles (Q4916098) (← links)
- Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs (Q4961756) (← links)
- $(3a:a)$-List-Colorability of Embedded Graphs of Girth at Least Five (Q5128509) (← links)
- Islands in Graphs on Surfaces (Q5743553) (← links)
- Amenable colorings (Q5906786) (← links)
- A note on list improper coloring planar graphs (Q5938913) (← links)
- Kempe equivalence of 4‐critical planar graphs (Q6047640) (← links)
- Flexibility of triangle‐free planar graphs (Q6055413) (← links)
- Flexibility of planar graphs without 4-cycles (Q6621243) (← links)
- Complexity of near-3-choosability problem (Q6632143) (← links)