✦ LIBER ✦

Binding number and Hamiltonian(g, f)-factors in graphs

✍ Scribed by Jiansheng Cai; Guizhen Liu

Publisher: Springer-Verlag
Year: 2007
Tongue: English
Weight: 186 KB
Volume: 25
Category: Article
ISSN: 1598-5865
DOI: 10.1007/bf02832363

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Binding numbers and f-factors of graphs

✍ Mikio Kano; Norihide Tokushige 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 351 KB

Hamiltonian ?-factors in graphs

✍ Wei, Bing; Zhu, Yongjin 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 128 KB 👁 2 views

Let k ≥ 2 be an integer. A k-factor F of a graph G is called a hamiltonian k-factor if F contains a hamiltonian cycle. In this paper, we shall prove that if G is a graph of order n with k ≥ 2, n ≥ 8k -4, kn even and δ(G) ≥ n/2, then G has a hamiltonian k-factor.

Orthogonal (g,f)-factorizations in graph

Orthogonal (g,f)-factorizations in graphs

✍ Guizhen Liu 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 362 KB

LetGbeagraphandletF={F,,F,,..., F,,,} and H be a factorization and a subgraph of G, respectively. If H has exactly one edge in common with Fi for all i, 1 < i < m, then we say that F is orthogonal to H. Let g andf be two integer-valued functions defined on V(G) such that g(x) < f(x) for every x E V(

On toughness and (g, f)-factors in bipar

On toughness and (g, f)-factors in bipartite graphs

✍ Qiuju Bian 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 165 KB

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

✍ Guojun Li*†; Ying Xu†; Chuanping Chen; Zhenhong Liu 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 227 KB

Randomly Orthogonal (g,f)-factorizations

Randomly Orthogonal (g,f)-factorizations in Graphs

✍ Gui-zhen Liu; He-ping Long 📂 Article 📅 2002 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 125 KB