Random Structures and Algorithms · 2013 · 62 citations · 19 references
Natural SciencesComputer ScienceMathematicsAlgorithmsCombinatoricsProbability TheoryGraph AlgorithmsGraph TheoryProbabilistic CombinatoricsEdge-disjoint PathsHamiltonian CyclesHamiltonian GraphsHamiltonian PathsHamiltonicity In Random GraphsRandom Graph TheoryRandom GraphsRandomized Graph Algorithms
We show that provided we can with high probability find a collection of edge-disjoint Hamilton cycles in , plus an additional edge-disjoint matching of size if is odd. This is clearly optimal and confirms, for the above range of p, a conjecture of Frieze and Krivelevich. © 2013 Wiley Periodicals, Inc. Random Struct. Alg., 46, 397–445, 2015
19
The Factorization of Linear Graphs
W. T. Tutte · Journal of the London Mathematical Society · 1947 · 939 citations
W. T. Tutte · Canadian Journal of Mathematics · 1952 · 301 citations · Full text