✦ LIBER ✦

Pseudo 2-factor isomorphic regular bipartite graphs

✍ Scribed by M. Abreu; A.A. Diwan; Bill Jackson; D. Labbate; J. Sheehan

Book ID: 108167436
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 156 KB
Volume: 98
Category: Article
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2007.08.006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Irreducible pseudo 2-factor isomorphic c

Irreducible pseudo 2-factor isomorphic cubic bipartite graphs

✍ Marién Abreu, Domenico Labbate, John Sheehan 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 311 KB

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

Pseudo and strongly pseudo 2-factor isom

Pseudo and strongly pseudo 2-factor isomorphic regular graphs and digraphs

✍ M. Abreu; D. Labbate; J. Sheehan 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 227 KB

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

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.

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