Bipartite toughness and \(k\)-factors in bipartite graphs (Q1008540)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Bipartite toughness and k-factors in bipartite graphs |
scientific article; zbMATH DE number 5534764
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bipartite toughness and \(k\)-factors in bipartite graphs |
scientific article; zbMATH DE number 5534764 |
Statements
Bipartite toughness and \(k\)-factors in bipartite graphs (English)
0 references
30 March 2009
0 references
Summary: 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.
0 references
0.8764461874961853
0 references
0.8662049770355225
0 references
0.8453593850135803
0 references
