Conflict-free coloring: graphs of bounded clique-width and intersection graphs
From MaRDI portal
Publication:6582374
DOI10.1007/s00453-024-01227-2MaRDI QIDQ6582374
Sriram Bhyravarapu, Hung P. Hoang, I. Vinod Reddy, Tim A. Hartmann, Subrahmanyam Kalyanasundaram
Publication date: 2 August 2024
Published in: Algorithmica (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- Complexity of conflict-free colorings of graphs
- Kneser's conjecture, chromatic number, and homotopy
- How to draw a planar graph on a grid
- Collision-free path coloring with application to minimum-delay gathering in sensor networks
- Distance-hereditary graphs
- Complement reducible graphs
- Parameterized algorithms for conflict-free colorings of graphs
- Upper bounds to the clique width of graphs
- Conflict-free coloring: graphs of bounded clique width and intersection graphs
- Parameterized complexity of conflict-free graph coloring
- The Roberts characterization of proper and unit interval graphs
- Minimum-weight triangulation is NP-hard
- Conflict-Free Colourings of Graphs and Hypergraphs
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
- Conflict-Free Coloring of Graphs
- Conflict-Free Coloring of Intersection Graphs
- A Short Note on Open-Neighborhood Conflict-Free Colorings of Graphs
- ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
- Conflict-Free Coloring and its Applications
- Conflict-Free Colouring of Graphs
- Parameterized Algorithms
- A logic-based algorithmic meta-theorem for mim-width
- Conflict-free coloring on claw-free graphs and interval graphs
This page was built for publication: Conflict-free coloring: graphs of bounded clique-width and intersection graphs
