Pages that link to "Item:Q845679"
From MaRDI portal
The following pages link to A note on the not 3-choosability of some families of planar graphs (Q845679):
Displayed 12 items.
- Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable (Q629363) (← links)
- On 3-choosability of planar graphs without certain cycles (Q963411) (← links)
- 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)
- Colouring of generalized signed triangle-free planar graphs (Q1712532) (← links)
- The 4-choosability of planar graphs and cycle adjacency (Q1981715) (← links)
- A refinement of choosability of graphs (Q2284741) (← links)
- Multiple list colouring triangle free planar graphs (Q2312604) (← links)
- A sufficient condition for a planar graph to be 3-choosable (Q2380013) (← links)
- A note on 3-choosability of planar graphs (Q2380076) (← links)
- Fine Structure of 4-Critical Triangle-Free Graphs I. Planar Graphs with Two Triangles and 3-Colorability of Chains (Q3177443) (← links)
- 3-Paintability of planar graphs (Q4554554) (← links)