Pages that link to "Item:Q2436833"
From MaRDI portal
The following pages link to Improper colorability of planar graphs without prescribed short cycles (Q2436833):
Displayed 5 items.
- Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph (Q458589) (← links)
- Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable (Q738860) (← links)
- Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable (Q898156) (← links)
- A sufficient condition for planar graphs with girth 5 to be \((1,7)\)-colorable (Q2359791) (← links)
- Every planar graph without cycles of length 4 or 9 is \((1, 1, 0)\)-colorable (Q2359954) (← links)