Pages that link to "Item:Q2172422"

The following pages link to Colorings with neighborhood parity condition (Q2172422):

Displaying 11 items.

• 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)
• 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)
• (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)