A toughness condition for fractional \((k,m)\)-deleted graphs (Q2377232): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2013.01.021 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2008496735 / rank | |||
Normal rank | |||
Latest revision as of 14:39, 19 March 2024
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
