All regular multigraphs of even order and high degree are 1-factorable. Plantholt, Michael, Tipnis, Shailesh K. (2001) The Electronic Journal of Combinatorics [electronic only]
An upper bound for the minimum degree of a graph Ladislav Nebeský (1977) Czechoslovak Mathematical Journal
Asymptotics for the probability of connectedness and the distribution of number of components. Bell, Jason P., Bender, Edward A., Cameron, Peter J., Richmond, L.Bruce (2000) The Electronic Journal of Combinatorics [electronic only]
Atoms of cyclic connectivity in cubic graphs Roman Nedela, Martin Škoviera (1995) Mathematica Slovaca