Maximum graphs with a unique k-factor
暂无分享，去创建一个
Abstract For suitable integers p and k, let f(p, k) denote the maximum number of edges in a graph of order p which has a unique k-factor. The values of f(p, k) are determined for k = 2, p − 3, and p − 2 and the extremal graphs are determined.
[1] Curtis A. Barefoot,et al. A census of maximum uniquely hamiltonian graphs , 1981, J. Graph Theory.
[2] L. Lovász. On the structure of factorizable graphs , 1972 .
[3] Michael D. Plummer,et al. On the 1-factors of a non-separable graph , 1967 .
[4] John Sheehan,et al. Graphs with exactly one hamiltonian circuit , 1977, J. Graph Theory.