Concepedia
Discrete Applied Mathematics · 1993 · 14 citations · 4 references
Open access
ComputingComputer ScienceMathematicsAlgorithmsCombinatoricsDirected Acyclic GraphsGraph AlgorithmsGraph TheoryGraph Traversal AlgorithmsHamiltonian CyclesHamiltonian GraphsHamiltonian Path AlgorithmsHamiltonian Path ProblemHamiltonian Paths
4
Locally semicomplete digraphs: A generalization of tournaments
Jørgen Bang‐Jensen · Journal of Graph Theory · 1990 · 121 citations
Natural Sciences, Mathematics, Combinatorics +10
A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular‐arc graphs, and nested interval graphs
Dale Skrien · Journal of Graph Theory · 1982 · 77 citations
Natural Sciences, Computer Science, Mathematics +12
The complexity of finding generalized paths in tournaments
Pavol Hell, Moshe Rosenfeld · Journal of Algorithms · 1983 · 28 citations
Computing, Computer Science, Mathematics +9
A linear-time algorithm for finding Hamiltonian cycles in tournaments
Yannis Manoussakis · Discrete Applied Mathematics · 1992 · 22 citations