𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Connected [g,f+1]-Factors in Graphs

✍ Scribed by Guojun Li*†; Ying Xu†; Chuanping Chen; Zhenhong Liu

Publisher
Springer-Verlag
Year
2005
Tongue
English
Weight
227 KB
Volume
25
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Connected (g, f)-factors
Connected (g, f)-factors
✍ M. N. Ellingham; Yunsun Nam; Heinz-Jürgen Voss 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB

## Abstract In this paper we study connected (__g, f__)‐factors. We describe an algorithm to connect together an arbitrary spanning subgraph of a graph, without increasing the vertex degrees too much; if the algorithm fails we obtain information regarding the structure of the graph. As a consequenc

Connected [k, k + 1]-factors of graphs
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