Pages that link to "Item:Q738860"
From MaRDI portal
The following pages link to Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable (Q738860):
Displaying 4 items.
- Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable (Q1690217) (← links)
- Planar graphs without adjacent cycles of length at most five are (2, 0, 0)-colorable (Q2021579) (← links)
- A relaxation of Novosibirsk 3-color conjecture (Q2075515) (← links)
- Every planar graph without triangles adjacent to cycles of length 3 or 6 is \(( 1 , 1 , 1 )\)-colorable (Q2174590) (← links)