𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Structural Remarks on Bipartite Graphs with Uniquef-Factors

✍ Scribed by Arne Hoffmann; Lutz Volkmann

Publisher
Springer Japan
Year
2005
Tongue
English
Weight
97 KB
Volume
21
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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.

Some problems on factorizations with con
Some problems on factorizations with constraints in bipartite graphs
✍ Guizhen Liu; Binhai Zhu πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 156 KB

Let G = (X; Y; E(G)) be a bipartite graph with vertex set V (G) = X βˆͺ Y and edge set E(G) and let g and f be two non-negative integer-valued functions deΓΏned on V (G) such that g(x) 6 f(x) for each x ∈ V (G). A (g; f)-factor of G is a spanning subgraph F of G such that g(x) 6 dF (x) 6 f(x) for each

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