Feb 3, 2015 · Abstract:The existence of an on-line competitive algorithm for coloring bipartite graphs remains a tantalizing open problem.
Feb 9, 2016 · In this section we introduce a family of bipartite graphs without long induced paths (P_6-free) and with arbitrarily large on-line chromatic ...
In this section we introduce a family of bipartite graphs without long induced paths (P6-free) and with arbitrarily large on-line chromatic number. All the ...
The existence of an on-line competitive algorithm for coloring bipartite graphs remains a tantalizing open problem. So far there are only partial positive ...
An On-line Competitive Algorithm for Coloring $$P_8$$ -free Bipartite ...
link.springer.com › chapter
Nov 8, 2014 · We propose a new on-line competitive coloring algorithm for P 8 -free bipartite graphs. Our proof technique improves the result, and shortens ...
An On-line competitive algorithm for coloring bipartite graphs without long induced paths · Micek, Piotr; Wiechert, Veit · FG Diskrete Mathematik.
We propose a new on-line competitive coloring algorithm for P 8 P_8 -free bipartite graphs. Our proof technique improves the result, and shortens the proof, for ...
The existence of an on-line competitive algorithm for coloring bipartite graphs remains a tantalizing open problem. So far there are only partial positive ...
An on-line competitive algorithm for coloring bipartite graphs without long induced paths. P. Micek, and V. Wiechert. CoRR, (2015 ).
We prove that the algorithm is on-line competitive for P 7 -free bipartite graphs, i.e., that do not contain an induced path on seven vertices. The number of ...