Pages that link to "Item:Q657261"
From MaRDI portal
The following pages link to On 3-choosability of triangle-free plane graphs (Q657261):
Displaying 7 items.
- Planar graphs without 3-, 7-, and 8-cycles are 3-choosable (Q1045077) (← links)
- Note on 3-choosability of planar graphs with maximum degree 4 (Q2324500) (← links)
- Every triangle-free induced subgraph of the triangular lattice is \((5m,2m)\)-choosable (Q2636827) (← links)
- (Q3011725) (← links)
- (Q3180354) (← links)
- (Q4642877) (← links)
- (Q5492576) (← links)