Pages that link to "Item:Q2689651"
From MaRDI portal
The following pages link to A note on odd colorings of 1-planar graphs (Q2689651):
Displaying 12 items.
- Remarks on proper conflict-free colorings of graphs (Q2099465) (← links)
- The odd chromatic number of a planar graph is at most 8 (Q2689111) (← links)
- (Q4458315) (← links)
- 1-planar graphs are odd 13-colorable (Q6041551) (← links)
- Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth (Q6080127) (← 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)
- A Note on Odd Colorings of 1-Planar Graphs (Q6390229) (← links)
- Improper odd coloring of IC-planar graphs (Q6611008) (← links)
- Brooks-type theorems for relaxations of square colorings (Q6635100) (← links)
- New bounds for odd colourings of graphs (Q6671589) (← links)