✦ LIBER ✦

On 2-factors of a bipartite graph

✍ Scribed by Wang, Hong

Publisher: John Wiley and Sons
Year: 1999
Tongue: English
Weight: 191 KB
Volume: 31
Category: Article
ISSN: 0364-9024
DOI: 10.1002/(sici)1097-0118(199906)31:2<101::aid-jgt3>3.0.co;2-5

No coin nor oath required. For personal study only.

✦ Synopsis

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 isomorphic to H.

📜 SIMILAR VOLUMES

Proof of a conjecture on cycles in a bip

Proof of a conjecture on cycles in a bipartite graph

✍ Wang, Hong 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 244 KB 👁 2 views

It was conjectured in [Wang, to appear in The Australasian Journal of Combinatorics] that, for each integer k ≥ 2, there exists . This conjecture is also verified for k = 2, 3 in [Wang, to appear; Wang, manuscript]. In this article, we prove this conjecture to be true if n ≥ 3k, i.e., M (k) ≤ 3k. W

A sufficient condition for bipartite gra

A sufficient condition for bipartite graphs to be type one

✍ Xu, Baogang 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 58 KB 👁 1 views

The total chromatic number χ T (G) of graph G is the least number of colors assigned to V (G) ∪ E(G) such that no adjacent or incident elements receive the same color. In this article, we give a sufficient condition for a bipartite graph G to have χ T (G) = ∆(G) + 1.

Enumerating the orientable 2-cell imbedd

Enumerating the orientable 2-cell imbeddings of complete bipartite graphs

✍ Mull, Bruce P. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 153 KB 👁 2 views

A formula is developed for the number of congruence classes of 2cell imbeddings of complete bipartite graphs in closed orientable surfaces.

Constructing a bipartite graph of maximu

Constructing a bipartite graph of maximum connectivity with prescribed degrees

✍ Asano, Takao 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 328 KB 👁 2 views

d 2,n 2 ) is a bipartite graphical sequence, if there is a bipartite graph G with degrees {D 1 , D 2 } (i.e., G has two independent vertex sets In other words, {D 1 , D 2 } is a bipartite graphical sequence if and only if there is an n 1 1 n 2 matrix of 0's and 1's having d 1j 1 1's in row j 1 and

On the structure of graphs with a unique

On the structure of graphs with a unique k-factor

✍ Petra Johann 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 207 KB 👁 1 views

An addendum to the most vital edges of m

An addendum to the most vital edges of matching in a bipartite graph

✍ Volgenant, A. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 50 KB 👁 2 views