Conflict-free coloring: graphs of bounded clique width and intersection graphs
From MaRDI portal
Publication:2115843
DOI10.1007/978-3-030-79987-8_7OpenAlexW3183500635MaRDI QIDQ2115843FDOQ2115843
I. Vinod Reddy, Sriram Bhyravarapu, Tim A. Hartmann, Subrahmanyam Kalyanasundaram
Publication date: 22 March 2022
Full work available at URL: https://arxiv.org/abs/2105.08693
Cites Work
- Complement reducible graphs
- Upper bounds to the clique width of graphs
- Approximating clique-width and branch-width
- Kneser's conjecture, chromatic number, and homotopy
- Distance-hereditary graphs
- Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
- Conflict-Free Colourings of Graphs and Hypergraphs
- Conflict-Free Coloring of Graphs
- Complexity of conflict-free colorings of graphs
- Conflict-Free Coloring and its Applications
- The Roberts characterization of proper and unit interval graphs
- Title not available (Why is that?)
- Parameterized algorithms for conflict-free colorings of graphs
- Parameterized complexity of conflict-free graph coloring
- Conflict-free coloring of string graphs
- Combinatorial bounds for conflict-free coloring on open neighborhoods
- A Short Note on Open-Neighborhood Conflict-Free Colorings of Graphs
Cited In (7)
- Conflict-free coloring: graphs of bounded clique-width and intersection graphs
- Exactly hittable interval graphs
- Conflict-free coloring of intersection graphs of geometric objects
- A short note on conflict‐free coloring on closed neighborhoods of bounded degree graphs
- A tight bound for conflict-free coloring in terms of distance to cluster
- On \(d\)-stable locally checkable problems parameterized by mim-width
- Minimum conflict free colouring parameterized by treewidth
This page was built for publication: Conflict-free coloring: graphs of bounded clique width and intersection graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115843)
