✦ LIBER ✦

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

✍ Scribed by Qiuju Bian

Publisher: Springer-Verlag
Year: 2006
Tongue: English
Weight: 165 KB
Volume: 22
Category: Article
ISSN: 1598-5865
DOI: 10.1007/bf02832055

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

f-Factors in bipartite (mf)-graphs

✍ Guizhen Liu; Wenan Zang 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 227 KB

## Katerinis and Tsikopoulos (Graphs. Combin. 12 (1996) 327) give su cient conditions for a regular bipartite graph to have a perfect matching excluding a set of edges. In this paper, we give a necessary and su cient condition for a bipartite graph to have an f-factor containing a set of edges and

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

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

A note on the f-factor-lattice of bipart

A note on the f-factor-lattice of bipartite graphs

✍ J Rieder 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 406 KB

On (g, f)-factorizations of graphs

✍ Ma Runnian; Gao Hangshan 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 174 KB

Binding number and Hamiltonian(g, f)-fac

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

✍ Jiansheng Cai; Guizhen Liu 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 186 KB

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(