Bipartite Toughness and the k-Factors in Bipartite Graphs

Authors

Guizhen Liu, Shandong University
Jianbo Quan, Memorial University of Newfoundland
Jonathan Z. Sun, University of Southern MississippiFollow
Rui Xu, The State University of West Georgia

Document Type

Article

Publication Date

2008

Department

Mathematics

School

Mathematics and Natural Sciences

Abstract

We define a new invariant t^B(G) in bipartite graphs that is analogous to the toughness t(G) and we give sufficient conditions in term of t^B(G) for the existence of k-factors in bipartite graphs. We also show that these results are sharp.

Comments

Published by International Journal of Mathematics and Mathematical Sciences at 10.1155/2008/597408.

Publication Title

International Journal of Mathematics and Mathematical Sciences

Volume

2008

Recommended Citation

Liu, G., Quan, J., Sun, J. Z., Xu, R. (2008). Bipartite Toughness and the k-Factors in Bipartite Graphs. International Journal of Mathematics and Mathematical Sciences, 2008.
Available at: https://aquila.usm.edu/fac_pubs/15402