Strong conflict-free coloring for intervals
From MaRDI portal
Publication:487034
DOI10.1007/S00453-014-9929-XzbMATH Open1306.05055OpenAlexW1979621790MaRDI QIDQ487034FDOQ487034
Authors: Luisa Gargano, Adele A. Rescigno, Shakhar Smorodinsky, Panagiotis Cheilaris 
Publication date: 19 January 2015
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-014-9929-x
Recommendations
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)
Cites Work
- Approximating Longest Cycles in Graphs with Bounded Degrees
- Title not available (Why is that?)
- Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
- Online conflict-free coloring for intervals
- Deterministic conflict-free coloring for intervals: from offline to online
- Conflict-free coloring and its applications
- Conflict-free coloring made stronger
- Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles
- Conflict-free coloring of points on a line with respect to a set of intervals
- Conflict-free coloring of unit disks
- Online conflict-free colouring for hypergraphs
Cited In (15)
- Conflict-free coloring of graphs
- Polynomial time algorithms for bichromatic problems
- Dynamic conflict-free colorings in the plane
- Exactly hittable interval graphs
- Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points
- Conflict-free coloring of points on a line with respect to a set of intervals
- Strong conflict-free coloring for intervals
- Dynamic conflict-free colorings in the plane
- Complexity of conflict-free colorings of graphs
- Conflict-free coloring of intersection graphs
- On variants of conflict-free-coloring for hypergraphs
- Fully-dynamic and kinetic conflict-free coloring of intervals with respect to points
- Conflict-free coloring of intersection graphs
- A survey on conflict-free connection coloring of graphs
- On \(k\)-strong conflict-free multicoloring
This page was built for publication: Strong conflict-free coloring for intervals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q487034)
