Pages that link to "Item:Q2172422"
From MaRDI portal
The following pages link to Colorings with neighborhood parity condition (Q2172422):
Displaying 21 items.
- A note on weak odd edge-colorings of graphs (Q266706) (← links)
- Some new characterizations of graph colorability and of blocking sets of projective spaces (Q405185) (← links)
- Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods (Q2097169) (← links)
- Remarks on proper conflict-free colorings of graphs (Q2099465) (← links)
- Remarks on odd colorings of graphs (Q2172423) (← links)
- The odd chromatic number of a planar graph is at most 8 (Q2689111) (← links)
- Odd coloring of sparse graphs and planar graphs (Q2689480) (← links)
- A note on odd colorings of 1-planar graphs (Q2689651) (← links)
- Vertex colorings of graphs without short odd cycles (Q3096961) (← links)
- Odd edge coloring of graphs (Q3465663) (← links)
- Odd-sum colorings of graphs (Q5883509) (← links)
- 1-planar graphs are odd 13-colorable (Q6041551) (← links)
- On conflict-free proper colourings of graphs without small degree vertices (Q6056427) (← 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)
- Proper conflict-free coloring of sparse graphs (Q6657259) (← links)
- New bounds for odd colourings of graphs (Q6671589) (← links)
