Recommendations
Cites work
- scientific article; zbMATH DE number 3888913 (Why is no real title available?)
- Approximating Longest Cycles in Graphs with Bounded Degrees
- Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
- Conflict-free coloring and its applications
- Conflict-free coloring made stronger
- Conflict-free coloring of points on a line with respect to a set of intervals
- Conflict-free coloring of unit disks
- Deterministic conflict-free coloring for intervals: from offline to online
- Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles
- Online conflict-free coloring for intervals
- 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
- Complexity of conflict-free colorings of graphs
- On variants of conflict-free-coloring for hypergraphs
- Dynamic conflict-free colorings in the plane
- Conflict-free coloring of intersection graphs
- 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)
