Login / Signup

Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs.

Enno BußHiêp HànMathias Schacht
Published in: J. Comb. Theory, Ser. B (2013)
Keyphrases
  • sufficient conditions
  • artificial intelligence
  • graph theory
  • hamiltonian cycle
  • web services
  • database systems
  • similarity measure
  • multiscale
  • shortest path
  • environmental conditions
  • minimum length