A sufficient condition for a bipartite graph to have a <i>k</i>‐factor (Q5749320)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4183455
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A sufficient condition for a bipartite graph to have a <i>k</i>‐factor |
scientific article; zbMATH DE number 4183455 |
Statements
A sufficient condition for a bipartite graph to have a <i>k</i>‐factor (English)
0 references
1988
0 references
existence
0 references
k-factor
0 references
bipartite graph
0 references
0.9211211
0 references
0.91689247
0 references
0.90415925
0 references
0.9036745
0 references
0 references
0.9029283
0 references
0.8958608
0 references
