The following pages link to Conflict-Free Coloring of Graphs (Q4556952):
Displayed 11 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)
- Structural parameterization for minimum conflict-free colouring (Q2161251) (← 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)
- Parameterized Complexity of Conflict-Free Graph Coloring (Q4959657) (← links)
- A Short Note on Open-Neighborhood Conflict-Free Colorings of Graphs (Q5128500) (← links)
- Colouring a dominating set without conflicts: \(q\)-subset square colouring (Q6077071) (← links)
- Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth (Q6080127) (← links)
- On odd colorings of planar graphs (Q6080172) (← links)