Online hypergraph coloring with rejection

DOI10.1515/AUSI-2015-0009MaRDI QIDQ5501518zbMATH OpenOpenAlexFDO

Authors Csanád Imreh, Judit Nagy-György

Publication date 4 August 2015

Published in Acta Universitatis Sapientiae, Informatica (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

Full work available at URL https://doi.org/10.1515/ausi-2015-0009

zbMATH Keywords

competitive ratiohypergraph coloringonline algorithms

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85) Online algorithms; streaming algorithms (68W27)

Recommendations

• Online coloring of hypergraphs
• Online hypergraph coloring
• Online conflict-free colouring for hypergraphs
• Online Conflict-Free Colorings for Hypergraphs
• Randomized online graph coloring
• Online graph coloring against a randomized adversary
• On-line P-coloring of graphs
• On-Line Coloring and Recursive Graph Theory
• Online coloring co-interval graphs
• On-line coloring \(k\)-colorable graphs

Cites work

• Deterministic conflict-free coloring for intervals: from offline to online
• Graph coloring with rejection
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• scientific article; zbMATH DE number 1418264 (Why is no real title available?)
• Online and quasi-online colorings of wedges and intervals
• Online coloring of hypergraphs
• Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles
• Online Conflict-Free Colorings for Hypergraphs
• Online Conflict‐Free Coloring for Intervals
• Online hypergraph coloring

Cited in

(3)

• Graph Coloring with Rejection
• Graph coloring with rejection
• Online hypergraph coloring

This page was built for publication: Online hypergraph coloring with rejection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501518)