Pages that link to "Item:Q2115843"
From MaRDI portal
The following pages link to Conflict-free coloring: graphs of bounded clique width and intersection graphs (Q2115843):
Displaying 7 items.
- Minimum conflict free colouring parameterized by treewidth (Q779250) (← links)
- A tight bound for conflict-free coloring in terms of distance to cluster (Q2166302) (← links)
- Conflict-free coloring of intersection graphs of geometric objects (Q2207603) (← links)
- A short note on conflict‐free coloring on closed neighborhoods of bounded degree graphs (Q6080863) (← links)
- On \(d\)-stable locally checkable problems parameterized by mim-width (Q6202932) (← links)
- Conflict-free coloring: graphs of bounded clique-width and intersection graphs (Q6582374) (← links)
- Exactly hittable interval graphs (Q6599815) (← links)