Pages that link to "Item:Q489724"
From MaRDI portal
The following pages link to Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable (Q489724):
Displaying 4 items.
- \((1,0,0)\)-colorability of planar graphs without prescribed short cycles (Q498436) (← links)
- Planar graphs without 4-cycles and close triangles are \((2,0,0)\)-colorable (Q721920) (← links)
- Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable (Q898156) (← links)
- Defective 2-colorings of planar graphs without 4-cycles and 5-cycles (Q1637126) (← links)
