𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Cycles in 2-Factors of Balanced Bipartite Graphs

✍ Scribed by Guantao Chen; Ralph J. Faudree; Ronald J. Gould; Michael S. Jacobson; Linda Lesniak


Publisher
Springer Japan
Year
2000
Tongue
English
Weight
190 KB
Volume
16
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Balanced cycles and holes in bipartite g
✍ Michele Conforti; GΓ©rard CornuΓ©jols; Kristina VuΕ‘koviΔ‡ πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 414 KB

Bruce Reed asks the following question: Can we determine whether a bipartite graph contains a chordless cycle whose length is a multiple of 4? We show that the two following more general questions are equivalent and we provide an answer. Given a bipartite graph G where each edge is assigned a weight

Balanced coloring of bipartite graphs
✍ Uriel Feige; Shimon Kogan πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 128 KB

## Abstract Given a bipartite graph __G__(__U__βˆͺ__V, E__) with __n__ vertices on each side, an independent set __I__∈__G__ such that |__U__∩__I__|=|__V__∩__I__| is called a balanced bipartite independent set. A balanced coloring of __G__ is a coloring of the vertices of __G__ such that each color c

Long cycles in bipartite graphs
✍ Bill Jackson πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 735 KB
Balanced bipartite graphs may be complet
✍ Nigel Martin πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 137 KB πŸ‘ 1 views

We conclude the study of complete K1,q-factorizations of complete bipartite graphs of the form Kn,n and show that, so long as the obvious Basic Arithmetic Conditions are satisfied, such complete factorizations must exist.