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

DOI10.14232/ACTACYB.23.3.2018.13zbMATH Open1413.05121OpenAlexW2874420044WikidataQ129529199 ScholiaQ129529199MaRDI QIDQ4584661FDOQ4584661

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

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

zbMATH Keywords

coloring bipartite graphs

Mathematics Subject Classification ID

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

Cited In (5)

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

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)