Maximal sets of Hamilton cycles in complete multipartite graphs II

@article{Jarrell2003MaximalSO,
  title={Maximal sets of Hamilton cycles in complete multipartite graphs II},
  author={Sasha Logan Jarrell and Christopher A. Rodger},
  journal={Journal of Graph Theory},
  year={2003},
  volume={43},
  pages={49-66}
}
A set S of edge-disjoint hamilton cycles in a graph G is said to be maximal if the edges in the hamilton cycles in S induce a subgraph H of G such that G EðHÞ contains no hamilton cycles. In this context, the spectrum SðGÞ of a graph G is the set of integersm such that G contains a maximal set of m edge-disjoint hamilton cycles. This spectrum has 
BETA

Figures and Topics from this paper.

Explore Further: Topics Discussed in This Paper

Similar Papers

Loading similar papers…