CIAC 2006: Algorithms and Complexity pp 284-295

On-Line Coloring of H-Free Bipartite Graphs

  • H. J. Broersma
  • A. Capponi
  • D. Paulusma
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3998)

Abstract

We present a new on-line algorithm for coloring bipartite graphs. This yields a new upper bound on the on-line chromatic number of bipartite graphs, improving a bound due to Lovász, Saks and Trotter. The algorithm is on-line competitive on various classes of H – free bipartite graphs, in particular P6-free bipartite graphs and P7-free bipartite graphs, i.e., that do not contain an induced path on six, respectively seven vertices. The number of colors used by the on-line algorithm in these particular cases is bounded by roughly twice, respectively roughly eight times the on-line chromatic number. In contrast, it is known that there exists no competitive on-line algorithm to color P6-free (or P7-free) bipartite graphs, i.e., for which the number of colors is bounded by any function only depending on the chromatic number.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • H. J. Broersma
    • 1
  • A. Capponi
    • 2
  • D. Paulusma
    • 1
  1. 1.Department of Computer ScienceDurham UniversityDurhamEngland
  2. 2.Computer Science, Division of Engineering and Applied SciencesCalifornia Institute of TechnologyU.S.A.

Personalised recommendations