๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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

โœ Scribed by Arne Hoffmann; Lutz Volkmann


Book ID
108315914
Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
234 KB
Volume
278
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


ON UNIQUELY -G k-COLOURABLE GRAPHS
โœ Brown, J. I.; Corneil, D. G. ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Taylor and Francis Group ๐ŸŒ English โš– 445 KB
Connected [k, k + 1]-factors of graphs
โœ Mao-cheng Cai ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 541 KB

Let k be an odd integer /> 3, and G be a connected graph of odd order n with n/>4k -3, and minimum degree at least k. In this paper it is proved that if for each pair of nonadjacent vertices u, v in G max{dG(u), d~(v)} >~n/2, then G has an almost k--factor F + and a matching M such that F-and M are