On-Line Coloring of H-Free Bipartite Graphs

DOI10.1007/11758471_28zbMath1183.68748OpenAlexW1488681147MaRDI QIDQ3434564

Daniël Paulusma, Agostino Capponi, Hajo J. Broersma

Publication date: 2 May 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11758471_28

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Online algorithms; streaming algorithms (68W27)

Related Items (3)

An On-line Competitive Algorithm for Coloring $$P_8$$-free Bipartite Graphs ⋮ An on-line competitive algorithm for coloring bipartite graphs without long induced paths ⋮ Online hypergraph coloring

This page was built for publication: On-Line Coloring of H-Free Bipartite Graphs