Discrete Mathematics · 1994 · 20 citations · 6 references
ComputingComputer ScienceAlgorithmsDirected Acyclic GraphsGraph AlgorithmsGraph TheoryHamiltonian SystemsHamiltonian CyclesHamiltonian GraphsHamiltonian PathsUpper Bound ComputationUpper Bounds
6
Characterizations of derived graphs
Lowell W. Beineke · Journal of Combinatorial Theory · 1970 · 251 citations
A reduction method to find spanning Eulerian subgraphs
Paul A. Catlin · Journal of Graph Theory · 1988 · 233 citations
Gary Chartrand · Transactions of the American Mathematical Society · 1968 · 60 citations
On the hamiltonian index of a graph
Marko LovrečičSaraẑin · Discrete Mathematics · 1993 · 48 citations