The following pages link to (Q4811813):
Displaying 5 items.
- Distance constraints on short cycles for 3-colorability of planar graphs (Q497344) (← 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 structural theorem on embedded graphs and its application to colorings (Q1034219) (← links)
- Planar graphs without adjacent cycles of length at most seven are 3-colorable (Q1045158) (← links)
