The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity (Q3174237)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity |
scientific article |
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
