𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On 2–Factors with Prescribed Properties in a Bipartite Graph

✍ Scribed by Jin Yan; Gui Zhen Liu

Publisher
Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
2006
Tongue
English
Weight
154 KB
Volume
22
Category
Article
ISSN
1439-7617

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

Domination in a graph with a 2-factor
Domination in a graph with a 2-factor
✍ Ken-ichi Kawarabayashi; Michael D. Plummer; Akira Saito 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 77 KB

## Abstract Let γ(__G__) be the domination number of a graph __G__. Reed 6 proved that every graph __G__ of minimum degree at least three satisfies γ(__G__) ≤ (3/8)|__G__|, and conjectured that a better upper bound can be obtained for cubic graphs. In this paper, we prove that a 2‐edge‐connected cu