Edge-disjoint Hamiltonian cycles in hypertournaments.

Vojislav Petrovic Carsten Thomassen

Published in: J. Graph Theory (2006)

Keyphrases

edge disjoint
spanning tree
total length
minimum cost
neural network
running times
computational complexity
multiresolution
graph coloring