Online Rainbow Coloring In Graphs

by   Debasis Dwibedy, et al.

Rainbow coloring is a special case of edge coloring, where there must be at least one path between every distinct pair of vertices that consists of different color edges. Here, we may use the same color for the adjacent edges of a graph representing two different paths from a single vertex. In online rainbow coloring, we have no priori knowledge about the vertices and edges of the graph, in fact the edges are available one by one. We have to color an edge as soon as it arrives and before the arrival of the next edge. We can not revoke the coloring decision once it is made. According to our knowledge, there is no study of online rainbow coloring for graphs. In this paper, we make a first attempt to propose an online algorithm named Least Recently Used Color(LRUC) for online rainbow coloring. We analyze the performance of LRUC through competitive analysis. We show that LRUC is optimal for line graph, tree and star graph. For 1-cyclic graph, LRUC is shown to be (2-2/n)-competitive, where n>3. We obtain the competitive ratios of (n-1)/3 and n-1 for wheel and complete graphs respectively, where n is the number of vertices.


page 1

page 2

page 3

page 4


On Color Critical Graphs of Star Coloring

A star coloring of a graph G is a proper vertex-coloring such that no pa...

Star edge-coloring of some special graphs

The star chromatic index of a multigraph G, denoted by χ_star'(G), is th...

On the balanceability of some graph classes

Given a graph G, a 2-coloring of the edges of K_n is said to contain a b...

More relations between λ-labeling and Hamiltonian paths with emphasis on line graph of bipartite multigraphs

This paper deals with the λ-labeling and L(2,1)-coloring of simple graph...

Reconfiguration of colorings in triangulations of the sphere

In 1973, Fisk proved that any 4-coloring of a 3-colorable triangulation ...

Quasi-stable Coloring for Graph Compression: Approximating Max-Flow, Linear Programs, and Centrality

We propose quasi-stable coloring, an approximate version of stable color...

The Greedy Algorithm is not Optimal for On-Line Edge Coloring

Nearly three decades ago, Bar-Noy, Motwani and Naor showed that no onlin...

Please sign up or login with your details

Forgot password? Click here to reset