Supereulerian graphs: a survey
Journal of Graph Theory
Graphs without spanning closed trails
Discrete Mathematics
Eulerian subgraphs containing given edges
Discrete Mathematics
Graph Theory With Applications
Graph Theory With Applications
Hi-index | 0.00 |
For two integers s 驴 0,t 驴 0, a graph G is (s, t)-supereulerian, if 驴 X,Y 驴 E(G), with X 驴 Y = 驴 ,|X| ≤ s,|Y| ≤ t, G has a spanning eulerian subgraph H with X 驴 E(H) and Y 驴 E(H) = 驴. We prove that if G is (t + 2)-edge-connected and locally connected, then G is (2, t)-supereulerian, or G belongs to a well characterized class of graphs.