Pages that link to "Item:Q2671068"
From MaRDI portal
The following pages link to Planar graphs without \(\{4, 6, 8\}\)-cycles are 3-choosable (Q2671068):
Displaying 5 items.
- A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable (Q975410) (← links)
- Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable (Q1045155) (← links)
- Planar graphs without chordal 6-cycles are 4-choosable (Q1752596) (← links)
- (Q3099255) (← links)
- Planar graphs with maximum degree D at least 8 are (D+1)-edge-choosable (Q5419972) (← links)