𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Transformation of a graph into a bipartite graph by splitting vertices

✍ Scribed by O. F. Cherepov

Publisher
Springer US
Year
1976
Tongue
English
Weight
185 KB
Volume
11
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Packing two bipartite graphs into a comp
Packing two bipartite graphs into a complete bipartite graph
✍ Wang, Hong πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 131 KB πŸ‘ 3 views

For two integers a and b, we say that a bipartite graph G admits an (a, b)bipartition if G has a bipartition (X, Y ) such that |X| = a and |Y | = b. We say that two bipartite graphs G and H are compatible if, for some integers a and b, both G and H admit (a, b)-bipartitions. In this paper, we prove

Partition of a bipartite graph into cycl
Partition of a bipartite graph into cycles
✍ Hong Wang πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 241 KB

Wang, H., Partition of bipartite graph into cycles, Discrete Mathematics 117 (1993) 287-291. El-Zahar (1984) conjectured that if G is a graph on n, + n, + + nk vertices with ni > 3 for 1s i < k and minimum degree 6(G)>rn,/21+rn2/21+ ... +rn,/21, then G contains k vertex-disjoint cycles of lengths n,

Packing two forests into a bipartite gra
Packing two forests into a bipartite graph
✍ Wang, Hong πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 292 KB πŸ‘ 3 views

For two integers a and b, we say that a bipartite graph G admits an ( a , b)-bipartition if G has a bipartition ( X , Y ) such that /XI = a and ( Y / = b. We say that two bipartite graphs G and H are compatible if, for some integers a and b, both G and H admit ( a , b)-bipartitions. In this note, w

Vertex-disjoint cycles containing specif
Vertex-disjoint cycles containing specified vertices in a bipartite graph
✍ Guantao Chen; Hikoe Enomoto; Ken-ichi Kawarabayashi; Katsuhiro Ota; Dingjun Lou; πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 184 KB

## Abstract A minimum degree condition is given for a bipartite graph to contain a 2‐factor each component of which contains a previously specified vertex. Β© 2004 Wiley Periodicals, Inc. J Graph Theory 46: 145–166, 2004

Partition of a bipartite hamiltonian gra
Partition of a bipartite hamiltonian graph into two cycles
✍ Denise Amar πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 480 KB

We prove the following theorem. "I'neorem. If G is a balanced bipartite graph with bipartition (A, B), [A I = IBI = n, such that for any x ~ A, y ~ B, d(x) + d(y) >>-n + 2, then for any (nl, n2), ni >I 2, n -----n I + hE, G contains two independent cycles of lengths 2nl and 2n2.