Pages that link to "Item:Q2689111"
From MaRDI portal
The following pages link to The odd chromatic number of a planar graph is at most 8 (Q2689111):
Displaying 14 items.
- Planar graphs have two-coloring number at most 8 (Q1745736) (← links)
- Remarks on proper conflict-free colorings of graphs (Q2099465) (← links)
- Colorings with neighborhood parity condition (Q2172422) (← links)
- Remarks on odd colorings of graphs (Q2172423) (← links)
- Odd-sum colorings of graphs (Q5883509) (← links)
- 1-planar graphs are odd 13-colorable (Q6041551) (← 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)
- The odd chromatic number of a planar graph is at most 8 (Q6389527) (← 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)
- New bounds for odd colourings of graphs (Q6671589) (← links)