Pages that link to "Item:Q1045155"
From MaRDI portal
The following pages link to Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable (Q1045155):
Displaying 5 items.
- \((1,0,0)\)-colorability of planar graphs without prescribed short cycles (Q498436) (← links)
- Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable (Q629363) (← links)
- Some structural properties of planar graphs and their applications to 3-choosability (Q658061) (← links)
- DP-3-coloring of planar graphs without certain cycles (Q2022504) (← links)
- Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs (Q4564884) (← links)
