Micek, PiotrWiechert, Veit2017-08-292017-08-2920160178-4617https://depositonce.tu-berlin.de/handle/11303/6664http://dx.doi.org/10.14279/depositonce-6105The 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.en511 Allgemeine mathematische Prinzipien004 Datenverarbeitung; Informatik510 Mathematikon-line algorithmgraph coloringbipartite graphsArticle1432-0541