A toughness condition for fractional \((k,m)\)-deleted graphs (Q2377232)
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: A toughness condition for fractional (k,m)-deleted graphs |
scientific article; zbMATH DE number 6182345
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A toughness condition for fractional \((k,m)\)-deleted graphs |
scientific article; zbMATH DE number 6182345 |
Statements
A toughness condition for fractional \((k,m)\)-deleted graphs (English)
0 references
28 June 2013
0 references
combinatorial problems
0 references
graph
0 references
toughness
0 references
fractional \(k\)-factor
0 references
fractional \((k, m)\)-deleted graph
0 references
0.9250895977020264
0 references
0.91608464717865
0 references
0.9141972064971924
0 references
