Discrete Applied Mathematics · 1990 · 91 citations · 4 references
ComputingComputer ScienceMathematicsAlgorithmsCombinatoricsComputational ComplexityGraph AlgorithmsGraph LabelingGraph TheoryGraph-based LearningComputational Complexity Of Graph AlgorithmsNp-completenessNp-hardness
4
Tough graphs and hamiltonian circuits
Vašek Chvátal · Discrete Mathematics · 1973 · 617 citations
Toughness and the existence of <i>k</i>‐factors
Hikoe Enomoto, Bill Jackson, P. Katerinis et al. · Journal of Graph Theory · 1985 · 157 citations
Long cycles in graphs with large degree sums
Douglas C. Bauer, H.J. Veldman, A. Morgana et al. · Discrete Mathematics · 1990 · 68 citations · Full text
Carsten Thomassen · Proceedings of the London Mathematical Society · 1981 · 64 citations · Full text