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.
| Hlavní autoři: | , , , |
|---|---|
| Médium: | Článek |
| Jazyk: | English |
| Vydáno: |
Hindawi Limited
2008-01-01
|
| Edice: | International Journal of Mathematics and Mathematical Sciences |
| On-line přístup: | http://dx.doi.org/10.1155/2008/597408 |