𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Irreducible pseudo 2-factor isomorphic cubic bipartite graphs

✍ Scribed by Marién Abreu, Domenico Labbate, John Sheehan

Book ID
113064406
Publisher
Springer
Year
2011
Tongue
English
Weight
311 KB
Volume
64
Category
Article
ISSN
0925-1022

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The smallest 2-connected cubic bipartite
The smallest 2-connected cubic bipartite planar nonhamiltonian graph
✍ Takao Asano; Nobuji Saito; Geoffrey Exoo; Frank Harary 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 519 KB

## Butte producxd ihe first example of a 3-connected cubic planar nonhamihonian gJaph. On adding the cxmcition that the graph must he bipartite and admitting 2-connected graphs. We prove that the smallest possible such graph has 26 points and is unique.

On 2-factors of a bipartite graph
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