Login / Signup

The consecutive-4 digraphs are Hamiltonian.

Gerard J. ChangFrank K. HwangLi-Da Tong
Published in: J. Graph Theory (1999)
Keyphrases
  • equivalence classes
  • directed graph
  • graph coloring
  • image sequences
  • bayesian networks
  • object recognition
  • co occurrence
  • image compression
  • markov models