Rainbow Coloring of Graphs - Microsoft Research

More documents

Recommendations

Info

Rainbow Coloring of GraphsIn terms of two-way dominating setrc(G) ≤ rc(G[D]) + 3
Rainbow Coloring of GraphsThe ideaLet D be the two-way dominating set. Color the edges ofG[D] using rc(G[D]) = k colors.We group the vertices of V ′ = V − D into three sets X, Y , Z.Z is the set of isolated vertex in G[V ′ ]X, Y form a bipartition based on a spanning forest of theinduced subgraph on V ′ − D.
Page 1 and 2: Rainbow Coloring of GraphsRainbow C
Page 3 and 4: Rainbow Coloring of GraphsWhat is R
Page 5 and 6: Rainbow Coloring of GraphsIf there
Page 7 and 8: Rainbow Coloring of GraphsIf there
Page 9 and 10: Rainbow Coloring of GraphsAn obviou
Page 11 and 12: Rainbow Coloring of GraphsAlgorithm
Page 13 and 14: Rainbow Coloring of GraphsPrevious
Page 15 and 16: Rainbow Coloring of GraphsThe idea
Page 17: Rainbow Coloring of GraphsTwo-way d
Page 21 and 22: Rainbow Coloring of GraphsX − D e
Page 23 and 24: Rainbow Coloring of Graphslower and
Page 25 and 26: Rainbow Coloring of Graphstwo-way t
Page 27 and 28: Rainbow Coloring of GraphsBased on
Page 29 and 30: Rainbow Coloring of Graphs

Rainbow Coloring of Graphs - Microsoft Research

Create successful ePaper yourself

Delete template?

Save as template?