The following pages link to Choosability of planar graphs (Q1916256):
Displaying 16 items.
- Free choosability of outerplanar graphs (Q293600) (← links)
- Multiple list colouring of planar graphs (Q345127) (← links)
- List colourings of planar graphs (Q687126) (← links)
- Another proof of the 5-choosability of \(K_5\)-minor-free graphs (Q932663) (← links)
- Every planar graph is 5-choosable (Q1333334) (← links)
- Choosability of \(K_5\)-minor-free graphs (Q1584404) (← links)
- Path choosability of planar graphs (Q1627209) (← links)
- Choosability, edge choosability and total choosability of outerplane graphs (Q1840829) (← links)
- The edge-face choosability of plane graphs (Q1883606) (← links)
- Incidence choosability of graphs (Q2312648) (← links)
- An algebraic criterion for the choosability of graphs (Q2345516) (← links)
- List colourings of planar graphs. (Reprint) (Q2498006) (← links)
- Every triangle-free induced subgraph of the triangular lattice is \((5m,2m)\)-choosable (Q2636827) (← links)
- 2-distance choosability of planar graphs with a restriction for maximum degree (Q2698256) (← links)
- \((4,1)^*\)-choosability of planar graphs (Q2719962) (← links)
- Circular choosability of planar graphs with large girth. (Q2918609) (← links)
