Publisher： John Wiley & Sons Inc
E-ISSN： 1098-2418|44|3|328-354
ISSN： 1042-9832
Source： RANDOM STRUCTURES AND ALGORITHMS, Vol.44, Iss.3, 2014-05, pp. : 328-354
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Edge‐disjoint Hamilton cycles in random graphs
RANDOM STRUCTURES AND ALGORITHMS, Vol. 46, Iss. 3, 2015-05 ,pp. :
Access to resources
Recommend
Tight Hamilton cycles in random hypergraphs
RANDOM STRUCTURES AND ALGORITHMS, Vol. 46, Iss. 3, 2015-05 ,pp. :
Long cycles in random subgraphs of graphs with large minimum degree
RANDOM STRUCTURES AND ALGORITHMS, Vol. 45, Iss. 4, 2014-12 ,pp. :
Hamilton Decomposable Graphs with Specified Leaves
By Rodger C.A.
Graphs and Combinatorics, Vol. 20, Iss. 4, 2004-11 ,pp. :