Login / Signup

Every finite strongly connected digraph of stability 2 has a Hamiltonian path.

C. C. ChenP. Manalastas
Published in: Discret. Math. (1983)
Keyphrases
  • hamiltonian path
  • strongly connected
  • graph theoretic
  • directed graph
  • optimum path forest
  • stability analysis
  • search space
  • finite number
  • undirected graph
  • xml keys