Discrete Mathematics · 2002 · 38 citations · 13 references
Natural SciencesMathematicsCombinatoricsGraph AlgorithmsGraph TheoryHamiltonian MechanicsHamiltonian SystemsIterated MapsHamiltonian CircuitsHamiltonian GraphsLine Graphs
13
A reduction method to find spanning Eulerian subgraphs
Paul A. Catlin · Journal of Graph Theory · 1988 · 233 citations
Carsten Thomassen · Journal of Graph Theory · 1986 · 171 citations
Supereulerian graphs: A survey
Paul A. Catlin · Journal of Graph Theory · 1992 · 161 citations
The edge Hamiltonian path problem is NP-complete
Alan A. Bertossi · Information Processing Letters · 1981 · 101 citations