Online Conflict-Free Colorings for Hypergraphs
DOI10.1007/978-3-540-73420-8_21zbMATH Open1171.05422OpenAlexW2104639020MaRDI QIDQ5428811FDOQ5428811
Amotz Bar-Noy, Panagiotis Cheilaris, Shakhar Smorodinsky, Svetlana Olonetsky
Publication date: 28 November 2007
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73420-8_21
Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20) Analysis of algorithms (68W40) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)
Cited In (7)
- Online conflict-free coloring for intervals
- Dynamic Offline Conflict-Free Coloring for Unit Disks
- Online Bounded Coloring of Permutation and Overlap Graphs
- Conflict-free colourings of uniform hypergraphs with few edges
- Homotopy and Hom construction in the category of finite hypergraphs
- Dynamic Conflict-Free Colorings in the Plane
- Online hypergraph coloring with rejection
This page was built for publication: Online Conflict-Free Colorings for Hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5428811)
