Eulerian Subgraphs Containing Given Vertices
Zhao Zhang, Hao Li · SIAM Journal on Discrete Mathematics · 2011
A vertex set [Formula: see text] is [Formula: see text]-weak-edge-connected if, for every [Formula: see text] and [Formula: see text], there are [Formula: see text] edge-disjoint ([Formula: see text], [Formula: see text])-paths in [Formula: see text]. For a graph [Formula: see text] and a [Formula: see text]-weak-edge-connected vertex set [Formula: see text] with [Formula: see text] and [Formula: see text], we show that [Formula: see text] has an Eulerian subgraph containing all vertices in [Formula: see text].