elimination_forest (383B)
1 # Elimination forest 2 3 An *elimination forest* F for a graph G is a [forest] whose [nodes] are labeled injectively with vertices of G, with the requirement that for every [edge] (u,v) of G the nodes of F labeled by u and v are comparable, i.e., one is an [ancestor] of the other 4 5 It can be defined on [hypergraphs] and [relational_structures] via the [Gaifman_graph] 6 7 Up: [treedepth]