3-star factors in random d-regular graphs

European Journal of Combinatorics

Volumn 27, Issue 8 SPEC. ISS., 2006, Pages 1249-1262

  Assiyatun, Hilda ^a   Wormald, Nicholas ^b  

^a BANDUNG INSTITUTE OF TECHNOLOGY   (Indonesia)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33748540385     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejc.2006.05.003     Document Type: Article

References (14)

1. H. Assiyatun, Large subgraphs of regular graphs, Ph.D. Thesis, The University of Melbourne, Australia, 2002
2. Bender E.A., and Canfield E.R. The asymptotic number of labeled graphs with given degree sequences. Journal of Combinatorial Theory, Series A 24 (1978) 296-307
3. Bollobás B. Random Graphs (1985), Academic Press, London
4. Frieze A., Jerrum M., Molloy M., Robinson R., and Wormald N.C. Generating and counting Hamilton cycles in random regular graphs. Journal of Algorithms 21 (1996) 176-198
5. H. Garmo, Random railways and cycles in random regular graphs, Ph.D. Thesis, Uppsala University, Sweden, 1998
6. Garmo H. The asymptotic distribution of long cycles in random regular graphs. Random Structures & Algorithms 15 (1999) 43-92
7. Janson S. Random regular graphs: Asymptotic distribution and contiguity. Combinatorics, Probability and Computing 4 (1995) 369-405
8. Janson S., Łuczak T., and Ruciński A. Random Graphs (2000), Wiley, New York
9. Molloy M., Robalewska H., Robinson R.W., and Wormald N.C. 1-factorisations of random regular graphs. Random Structures & Algorithms 10 (1997) 305-321
10. Robalewska H.D. 2-factors in random regular graphs. Journal of Graph Theory 23 3 (1996) 215-224
11. Robinson R.W., and Wormald N.C. Existence of long cycles in random cubic graphs. In: Jackson D.M., and Vanstone S.A. (Eds). Enumeration and Design (1984), Academic Press, Toronto 251-270
12. Robinson R.W., and Wormald N.C. Almost all cubic graphs are hamiltonian. Random Structures & Algorithms 3 (1992) 117-125
13. Robinson R.W., and Wormald N.C. Almost all regular graphs are hamiltonian. Random Structures & Algorithms 5 (1994) 363-374
14. Wormald N.C. Models of random regular graphs. In: Lamb J.D., and Preece D.A. (Eds). Survey in Combinatorics. London Mathematical Society Lecture Notes Series vol. 276 (1999), Cambridge University Press, Cambridge