One-factor in random graphs based on vertex choice
- 31 December 1982
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 41 (3) , 281-286
- https://doi.org/10.1016/0012-365x(82)90023-1
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- On factors in random graphsIsrael Journal of Mathematics, 1981
- Matchings in random regular bipartite digraphsDiscrete Mathematics, 1980
- On the Expected Value of a Random Assignment ProblemSIAM Journal on Computing, 1979
- Hamiltonian circuits in random graphsDiscrete Mathematics, 1976
- On the existence of a factor of degree one of a connected random graphActa Mathematica Hungarica, 1966
- On the strength of connectedness of a random graphActa Mathematica Hungarica, 1964
- The Factorization of Linear GraphsJournal of the London Mathematical Society, 1947