Pages that link to "Item:Q2110602"
From MaRDI portal
The following pages link to Combinatorial bounds for conflict-free coloring on open neighborhoods (Q2110602):
Displaying 5 items.
- Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods (Q2097169) (← links)
- Conflict-free coloring: graphs of bounded clique width and intersection graphs (Q2115843) (← links)
- Conflict-free coloring bounds on open neighborhoods (Q2161000) (← links)
- A tight bound for conflict-free coloring in terms of distance to cluster (Q2166302) (← links)
- Odd coloring of sparse graphs and planar graphs (Q2689480) (← links)
