✦ LIBER ✦

On 2-factor hamiltonian regular bipartite graphs

✍ Scribed by Ku, Cheng Yeaw; Wong, Kok Bin

Book ID: 118794925
Publisher: Akadmiai Kiad
Year: 2012
Tongue: English
Weight: 408 KB
Volume: 138
Category: Article
ISSN: 1588-2632
DOI: 10.1007/s10474-012-0272-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Pseudo 2-factor isomorphic regular bipar

Pseudo 2-factor isomorphic regular bipartite graphs

✍ M. Abreu; A.A. Diwan; Bill Jackson; D. Labbate; J. Sheehan 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 156 KB

On Hamiltonian bipartite graphs

✍ J. Moon; L. Moser 📂 Article 📅 1963 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 133 KB

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.

Regular bipartite graphs with all 2-fact

Regular bipartite graphs with all 2-factors isomorphic

✍ R.E.L. Aldred; M. Funk; Bill Jackson; D. Labbate; J. Sheehan 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 237 KB

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

Almost 2-homogeneous Bipartite Distance-

Almost 2-homogeneous Bipartite Distance-regular Graphs

✍ Brian Curtin 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 170 KB