Bipartite Toughness and k-Factors in Bipartite Graphs
We define a new invariant tB(G) in bipartite graphs that is analogous to the toughness t(G) and we give sufficient conditions in term of tB(G) for the existence of k-factors in bipartite graphs. We also show that these results are sharp.
প্রধান লেখক: | , , , |
---|---|
বিন্যাস: | প্রবন্ধ |
ভাষা: | English |
প্রকাশিত: |
Hindawi Limited
2008-01-01
|
মালা: | International Journal of Mathematics and Mathematical Sciences |
অনলাইন ব্যবহার করুন: | http://dx.doi.org/10.1155/2008/597408 |