Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs

Katrin Casel, Tobias Friedrich, Davis Issac +2

In the 1970s, Győri and Lovász showed that for a $k$-connected $n$-vertex graph, a given set of terminal vertices $t_1,\dots ,t_k$ and natural numbers $n_1,\dots ,n_k$ satisfying…