Pages that link to "Item:Q6041551"
From MaRDI portal
The following pages link to 1-planar graphs are odd 13-colorable (Q6041551):
Displaying 9 items.
- Crossing lemma for the odd-crossing number (Q2088881) (← links)
- The odd chromatic number of a planar graph is at most 8 (Q2689111) (← links)
- A note on odd colorings of 1-planar graphs (Q2689651) (← links)
- On odd colorings of planar graphs (Q6080172) (← links)
- On odd colorings of sparse graphs (Q6145820) (← links)
- IC-planar graphs are odd-10-colorable (Q6160615) (← links)
- Improper odd coloring of IC-planar graphs (Q6611008) (← links)
- Odd 4-coloring of outerplanar graphs (Q6632147) (← links)
- Brooks-type theorems for relaxations of square colorings (Q6635100) (← links)