Thumbnail Image
🆕 Date Issued:
2016
🗄 In DepositOnce:2017-08-29
Published Version

Please use this identifier to cite or link to this item:

An On-line competitive algorithm for coloring bipartite graphs without long induced paths

Micek, Piotr; Wiechert, Veit

The existence of an on-line competitive algorithm for coloring bipartite graphs is a tantalizing open problem. So far there are only partial positive results for bipartite graphs with certain small forbidden graphs as induced subgraphs. We propose an on-line competitive coloring algorithm for P9-free bipartite graphs.
on-line algorithmgraph coloringbipartite graphs
Published in: Algorithmica, 10.1007/s00453-016-0130-2, Springer
Creative Commons Attribution 4.0 (CC BY)Creative Commons Attribution 4.0 (CC BY)
Full item page