Pages that link to "Item:Q2161000"

The following pages link to Conflict-free coloring bounds on open neighborhoods (Q2161000):

Displaying 4 items.

• Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods (Q2097169) (← links)
• The odd chromatic number of a planar graph is at most 8 (Q2689111) (← links)
• On odd colorings of planar graphs (Q6080172) (← links)
• A note on the conflict-free chromatic index (Q6197755) (← links)