Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at leastk
From MaRDI portal
Publication:4487074
DOI<42::AID-JGT5>3.0.CO;2-H 10.1002/(SICI)1097-0118(200005)34:1<42::AID-JGT5>3.0.CO;2-HzbMath0958.05122OpenAlexW4248246025WikidataQ101126724 ScholiaQ101126724MaRDI QIDQ4487074
Béla Bollobás, Colin Cooper, Alan M. Frieze, Trevor I. Fenner
Publication date: 21 June 2000
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(200005)34:1<42::aid-jgt5>3.0.co;2-h
Related Items
Finding Hamilton cycles in sparse random graphs, On large matchings and cycles in sparse random graphs, Crux and Long Cycles in Graphs, Graph factors and factorization: 1985--2003: a survey, On a greedy 2-matching algorithm and Hamilton cycles in random graphs with minimum degree at least three, On the threshold for \(k\)-regular subgraphs of random graphs, Size and connectivity of the \(k\)-core of a random graph, A scaling limit for the length of the longest cycle in a sparse random graph, Hamiltonicity in random graphs is born resilient, Cores of random graphs are born Hamiltonian
Cites Work
