Conditions of a graph being fractional \(k\)-factor-critical (Q4980794)
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 6311578
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Conditions of a graph being fractional \(k\)-factor-critical |
scientific article; zbMATH DE number 6311578 |
Statements
30 June 2014
0 references
fractional perfect matching
0 references
fractional \(k\)-factor-critical graph
0 references
toughness
0 references
fractional matching number
0 references
0.9088447093963624
0 references
0.8940690159797668
0 references
0.8927926421165466
0 references
0.8775269389152527
0 references
0.8636244535446167
0 references
