On packing Hamilton cycles in -regular graphs
Authors:
- 1 May 2005
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 94 (1) , 159-172
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Problems and results in extremal combinatorics—IDiscrete Mathematics, 2003
- Advances on the Hamiltonian Problem - A SurveyGraphs and Combinatorics, 2003
- Hamilton cycles in random subgraphs of pseudo-random graphsDiscrete Mathematics, 2002
- Random Matchings Which Induce Hamilton Cycles and Hamiltonian Decompositions of Random Regular GraphsJournal of Combinatorial Theory, Series B, 2001
- On the Number of Perfect Matchings and Hamilton Cycles in $\epsilon$-Regular Non-bipartite GraphsThe Electronic Journal of Combinatorics, 2000
- A Hamiltonian game on Kn,nDiscrete Mathematics, 1995
- Hamiltonian cycles in bipartite graphsCombinatorica, 1995
- Hamiltonian gamesJournal of Combinatorial Theory, Series B, 1992
- The Factorization of Linear GraphsJournal of the London Mathematical Society, 1947
- Die Theorie der regulären graphsActa Mathematica, 1891