Applied Mathematics Letters · 2011 · 16 citations · 5 references
Natural SciencesMathematicsPhysicsCombinatoricsTheoretical PhysicsTopologyDirected Acyclic GraphsGraph AlgorithmsGraph TheoryMatching TheoryTopological CombinatoricsGraph MatchingMatching AlgorithmsMatching Problems
5
A reduction method to find spanning Eulerian subgraphs
Paul A. Catlin · Journal of Graph Theory · 1988 · 233 citations
The spanning subgraphs of eulerian graphs
F Boesch, C Suffel, Ralph Tindell · Journal of Graph Theory · 1977 · 113 citations
F. M. Jaeger · Journal of Graph Theory · 1979 · 112 citations
Graphs without spanning closed trails
Paul A. Catlin, Zheng-Yiao Han, Hong‐Jian Lai · Discrete Mathematics · 1996 · 104 citations
A note on graphs spanned by Eulerian graphs
William R. Pulleyblank · Journal of Graph Theory · 1979 · 98 citations