Login / Signup

Degree conditions for Hamiltonian graphs to have [a, b]-factors containing a given Hamiltonian cycle.

Haruhide Matsuda
Published in: Discret. Math. (2004)
Keyphrases
  • hamiltonian cycle
  • graph coloring
  • traveling salesman problem
  • phase transition
  • combinatorial problems
  • job shop scheduling
  • sufficient conditions
  • constraint satisfaction problems
  • scheduling problem
  • max sat