Online Conflict-Free Colouring for Hypergraphs
From MaRDI portal
Publication:4933597
DOI10.1017/S0963548309990587zbMath1198.05137MaRDI QIDQ4933597
Svetlana Olonetsky, Panagiotis Cheilaris, Amotz Bar-Noy, Shakhar Smorodinsky
Publication date: 14 October 2010
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Dynamic conflict-free colorings in the plane, On Conflict-Free Multi-coloring, Conflict-Free Coloring of Graphs, Conflict-Free Coloring of Intersection Graphs, Tight bounds for online coloring of basic graph classes, Complexity of conflict-free colorings of graphs, Strong conflict-free coloring for intervals, On variants of conflict-free-coloring for hypergraphs, Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points, Tight Bounds for Online Coloring of Basic Graph Classes, Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points.
Cites Work
- A note on the online first-fit algorithm for coloring \(k\)-inductive graphs
- Coloring inductive graphs on-line
- On-line rankings of graphs
- Conflict-free coloring of points and simple regions in the plane
- On The Chromatic Number of Geometric Hypergraphs
- On-line and first fit colorings of graphs
- The Linearity of First-Fit Coloring of Interval Graphs
- Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
- Deterministic conflict-free coloring for intervals
- Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles
- Online Conflict‐Free Coloring for Intervals
