Split-by-edges trees


A split-by-edges tree of a graph G on n vertices is a binary tree T where the root = V(G), every leaf is an independent set in G, and for every other node N in T with children L and R there is a pair of vertices {u, v}  N such that L = N \ {v}, R = N \ {u}, and uv is an edge in G. The distance from the root to an independent set I is n – |I| and the… (More)


6 Figures and Tables

Slides referencing similar topics