The existence of a 2-factor in \(K_{1,n}\)-free graphs with large connectivity and large edge-connectivity (Q3174237)
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: The existence of a 2-factor in Kâ,n-free graphs with large connectivity and large edge-connectivity |
scientific article; zbMATH DE number 5957647
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The existence of a 2-factor in \(K_{1,n}\)-free graphs with large connectivity and large edge-connectivity |
scientific article; zbMATH DE number 5957647 |
Statements
The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity (English)
0 references
12 October 2011
0 references
2-factor
0 references
\(K_{1,n}\)-free graph
0 references
(edge-)connectivity
0 references
minimum degree
0 references
0.8710147738456726
0 references
0.8580787181854248
0 references
0.8486747741699219
0 references
0.8426289558410645
0 references
