An on-line competitive algorithm for coloring bipartite graphs without long induced paths
Data Structures and Algorithms
2015-02-04 v1 Combinatorics
Abstract
The existence of an on-line competitive algorithm for coloring bipartite graphs remains 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 a new on-line competitive coloring algorithm for -free bipartite graphs.
Keywords
Cite
@article{arxiv.1502.00859,
title = {An on-line competitive algorithm for coloring bipartite graphs without long induced paths},
author = {Piotr Micek and Veit Wiechert},
journal= {arXiv preprint arXiv:1502.00859},
year = {2015}
}