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.