Pages that link to "Item:Q2444905"
From MaRDI portal
The following pages link to Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable (Q2444905):
Displaying 3 items.
- Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph (Q458589) (← links)
- \((1,0,0)\)-colorability of planar graphs without prescribed short cycles (Q498436) (← links)
- Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable (Q898156) (← links)
