Online Conflict-Free Colorings for Hypergraphs

DOI10.1007/978-3-540-73420-8_21MaRDI QIDQ5428811zbMATH OpenOpenAlexFDO

Authors Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky

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

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20) Analysis of algorithms (68W40)

Recommendations

• Online conflict-free colouring for hypergraphs
• Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles
• Online conflict-free coloring for intervals
• Online Conflict‐Free Coloring for Intervals
• On conflict-free multi-coloring

Cited in

(13)

• Conflict-free colourings of uniform hypergraphs with few edges
• Online conflict-free coloring for intervals
• Online Bounded Coloring of Permutation and Overlap Graphs
• Dynamic Offline Conflict-Free Coloring for Unit Disks
• Online conflict-free colouring for hypergraphs
• Deterministic conflict-free coloring for intervals: from offline to online
• Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles
• Dynamic conflict-free colorings in the plane
• Online Conflict‐Free Coloring for Intervals
• Online hypergraph coloring with rejection
• Homotopy and Hom construction in the category of finite hypergraphs
• Online coloring of hypergraphs
• Hitting sets online and unique-MAX coloring

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)