Location of Repository

A new algorithm for on-line coloring bipartite graphs.

By H.J. Broersma, A. Capponi and Daniel Paulusma


We first show that for any bipartite graph $H$ with at most five vertices there exists an on-line competitive algorithm for the class of $H$-free bipartite graphs. We then analyze the performance of an on-line algorithm for coloring bipartite graphs on various subfamilies. The algorithm yields new upper bounds for the on-line chromatic number of bipartite graphs. 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 colors used by the on-line algorithm for $P_6$-free and $P_7$-free bipartite graphs is, respectively, bounded by roughly twice and roughly eight times the on-line chromatic number. In contrast, it is known that there exists no competitive on-line algorithm to color $P_6$-free (or $P_7$-free) bipartite graphs, i.e., for which the number of colors is bounded by any function depending only on the chromatic number

Publisher: Society for Industrial and Applied Mathematics
Year: 2008
DOI identifier: 10.1137/060668675
OAI identifier: oai:dro.dur.ac.uk.OAI2:7433

Suggested articles



  1. Coloring graphs on-line, in Online Algorithms: The State of the Art,
  2. (1991). Effective on-line coloring of P5-free graphs,
  3. (1990). First fit and on-line chromatic number of families of graphs,
  4. (1976). Graph Theory with Applications,
  5. (1994). Lower bounds for on-line graph coloring,
  6. (1997). On-line 3-chromatic graphs.
  7. (1988). On-line and first-fit colorings of graphs,
  8. (2002). On-line coloring of geometric intersection graphs,
  9. (2006). On-line coloring of H-free bipartite graphs,
  10. (2006). On-line coloring of Is-free graphs and co-planar graphs,
  11. (1997). Online Competitive Coloring Algorithms,
  12. (1998). Online Computation and Competitive Analysis,
  13. (1984). Problem 84–23,
  14. (1988). The linearity of first-fit coloring of interval graphs, doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.