Conflict-free coloring: graphs of bounded clique-width and intersection graphs
From MaRDI portal
(Redirected from Publication:6582374)
Cites work
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- A logic-based algorithmic meta-theorem for mim-width
- A short note on open-neighborhood conflict-free colorings of graphs
- Collision-free path coloring with application to minimum-delay gathering in sensor networks
- Complement reducible graphs
- Complexity of conflict-free colorings of graphs
- Conflict-free coloring and its applications
- Conflict-free coloring of graphs
- Conflict-free coloring of intersection graphs
- Conflict-free coloring on claw-free graphs and interval graphs
- Conflict-free coloring: graphs of bounded clique width and intersection graphs
- Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
- Conflict-free colouring of graphs
- Conflict-free colourings of graphs and hypergraphs
- Distance-hereditary graphs
- Fundamentals of parameterized complexity
- How to draw a planar graph on a grid
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- scientific article; zbMATH DE number 6737879 (Why is no real title available?)
- Kneser's conjecture, chromatic number, and homotopy
- Minimum-weight triangulation is NP-hard
- On the clique-width of some perfect graph classes
- Parameterized algorithms
- Parameterized algorithms for conflict-free colorings of graphs
- Parameterized complexity of conflict-free graph coloring
- The Roberts characterization of proper and unit interval graphs
- Upper bounds to the clique width of graphs
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 Q6582374)
