✦ LIBER ✦

On 2-factors containing 1-factors in bipartite graphs

✍ Scribed by Guantao Chen; Ronald J. Gould; Michael S. Jacobson

Book ID: 108316467
Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 396 KB
Volume: 197-198
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(99)90061-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Counting 1-Factors in Regular Bipartite

Counting 1-Factors in Regular Bipartite Graphs

✍ Alexander Schrijver 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 325 KB

We show that any k-regular bipartite graph with 2n vertices has at least \ (k&1) k&1 k k&2 + n perfect matchings (1-factors). Equivalently, this is a lower bound on the permanent of any nonnegative integer n\_n matrix with each row and column sum equal to k. For any k, the base (k&1) k&1 Âk k&2 is l

On 2-factors of a bipartite graph

✍ Wang, Hong 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 191 KB 👁 2 views

In this article, we consider the following problem: Given a bipartite graph G and a positive integer k, when does G have a 2-factor with exactly k components? We will prove that if , then, for any bipartite graph H = (U 1 , U 2 ; F ) with |U 1 | ≤ n, |U 2 | ≤ n and ∆(H) ≤ 2, G contains a subgraph i

On 2-factor hamiltonian regular bipartit

On 2-factor hamiltonian regular bipartite graphs

✍ Ku, Cheng Yeaw; Wong, Kok Bin 📂 Article 📅 2012 🏛 Akadmiai Kiad 🌐 English ⚖ 408 KB

Cycles in 2-Factors of Balanced Bipartit

Cycles in 2-Factors of Balanced Bipartite Graphs

✍ Guantao Chen; Ralph J. Faudree; Ronald J. Gould; Michael S. Jacobson; Linda Lesn 📂 Article 📅 2000 🏛 Springer Japan 🌐 English ⚖ 190 KB

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 two-factors of bipartite regular grap

On two-factors of bipartite regular graphs

✍ J.D. Horton 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 654 KB

The set of two-factors of a bipartite k-regular graph, k > 2, spans the cycle space of the graph. In addition, a new non-hamiltonian T-connected bicubic graph on 92 vertices is constructed.