On the advice complexity of coloring bipartite graphs and two-colorable hypergraphs

DOI10.14232/ACTACYB.23.3.2018.13MaRDI QIDQ4584661zbMATH OpenOpenAlexWikidataFDO

Authors Judit Nagy-György

Publication date 3 September 2018

Published in Acta Cybernetica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.14232/actacyb.23.3.2018.13

zbMATH Keywords

coloring bipartite graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Recommendations

• Online coloring of bipartite graphs with and without advice
• Online coloring of bipartite graphs with and without advice
• Advice complexity of the online coloring problem
• Advice complexity of online coloring for paths
• Optimal online edge coloring of planar graphs with advice

Cited in

(5)

• Advice complexity of online coloring for paths
• Online coloring of bipartite graphs with and without advice
• Optimal online edge coloring of planar graphs with advice
• Online coloring of bipartite graphs with and without advice
• Advice complexity of the online coloring problem

This page was built for publication: On the advice complexity of coloring bipartite graphs and two-colorable hypergraphs

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