Pages that link to "Item:Q1045077"
From MaRDI portal
The following pages link to Planar graphs without 3-, 7-, and 8-cycles are 3-choosable (Q1045077):
Displaying 11 items.
- On 3-choosability of triangle-free plane graphs (Q657261) (← links)
- On 3-choosability of planar graphs without certain cycles (Q963411) (← links)
- Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable (Q1045155) (← links)
- The Grötzsch theorem for the hypergraph of maximal cliques (Q1292236) (← links)
- DP-3-coloring of planar graphs without certain cycles (Q2022504) (← links)
- Planar graphs without normally adjacent short cycles (Q2144582) (← 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)
- (Q3099255) (← links)
- Planar Graphs without 7-Cycles Are 4-Choosable (Q3583295) (← links)
- Planar graphs with maximum degree D at least 8 are (D+1)-edge-choosable (Q5419972) (← links)