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
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
## 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
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.