Pages that link to "Item:Q1045158"
From MaRDI portal
The following pages link to Planar graphs without adjacent cycles of length at most seven are 3-colorable (Q1045158):
Displayed 10 items.
- Distance constraints on short cycles for 3-colorability of planar graphs (Q497344) (← links)
- A toughness condition for a spanning tree with bounded total excesses (Q497366) (← links)
- Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable (Q709301) (← links)
- Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable (Q738860) (← links)
- A step towards the strong version of Havel's three color conjecture (Q1931401) (← links)
- Planar graphs without adjacent cycles of length at most five are (2, 0, 0)-colorable (Q2021579) (← links)
- Every planar graph without adjacent cycles of length at most 8 is 3-choosable (Q2323250) (← links)
- Note on 3-choosability of planar graphs with maximum degree 4 (Q2324500) (← links)
- Facially-constrained colorings of plane graphs: a survey (Q2401805) (← links)
- Short proofs of coloring theorems on planar graphs (Q2441638) (← links)