A toughness condition for fractional \((k,m)\)-deleted graphs (Q2377232)
From MaRDI portal
 | This is a page for a Wikibase entity. It is used by other Wikibase pages, but it is generally not meant to be viewed directly. See A toughness condition for fractional \((k,m)\)-deleted graphs for the user view. |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A toughness condition for fractional \((k,m)\)-deleted graphs |
scientific article |
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
