Journal of Graph Theory · 1990 · 45 citations · 2 references
Natural SciencesMathematicsCombinatoricsCritical PhenomenaDirected Acyclic GraphsGraph AlgorithmsGraph TheoryHamiltonian CyclesHamiltonian GraphsHamiltonian Path AlgorithmsHamiltonian Path ProblemHamiltonian Paths
Abstract In this paper we show that every connected, 3‐γ‐critical graph on more than 6 vertices has a Hamiltonian path.
2
David P. Sumner, Pattie Blitch · Journal of Combinatorial Theory Series B · 1983 · 174 citations
Critical concepts in domination
David P. Sumner · Discrete Mathematics · 1990 · 76 citations