论文信息 - On unique k-factors and unique [1, k]-factors in graphs

On unique k-factors and unique [1, k]-factors in graphs

In the first part we examine bipartite graphs with a unique regular factor and present upper bounds for their number of edges. The second part deals with the maximum number of edges in graphs having a unique [1,k]-factor.

Lutz Volkmann | Arne Hoffmann

[1] Bill Jackson,et al. A note concerning graphs with unique f-factors , 1989, J. Graph Theory.

[2] D. König. Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre , 1916 .

[3] W. Mader,et al. 1-Faktoren von Graphen , 1973 .

[4] John Sheehan,et al. Graphs with exactly one hamiltonian circuit , 1977, J. Graph Theory.

[5] W. T. Tutte. The 1-factors of oriented graphs , 1953 .

[6] Petra Johann. On the structure of graphs with a unique k-factor , 2000, Electron. Notes Discret. Math..

[7] L. Lovász. On the structure of factorizable graphs , 1972 .

[8] G. R. T. Hendry. Maximum graphs with a unique k-factor , 1984, J. Comb. Theory, Ser. B.

[9] Lutz Volkmann. Fundamente der Graphentheorie , 1996, Springer Lehrbuch Mathematik.

[10] Lutz Volkmann. The Maximum Size Of Graphs With A Uniquek- Factor , 2004, Comb..

[11] Michael D. Plummer,et al. On the 1-factors of a non-separable graph , 1967 .