On \(2\)-factors in \(r\)-connected \(\{K_{1,k},P_4\}\)-free graphs (Q1012442)
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: On \(2\)-factors in \(r\)-connected \(\{K_{1,k},P_4\}\)-free graphs |
scientific article; zbMATH DE number 5545421
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On \(2\)-factors in \(r\)-connected \(\{K_{1,k},P_4\}\)-free graphs |
scientific article; zbMATH DE number 5545421 |
Statements
On \(2\)-factors in \(r\)-connected \(\{K_{1,k},P_4\}\)-free graphs (English)
0 references
21 April 2009
0 references
2-factor
0 references
forbidden subgraph
0 references
minimum degree
0 references
0.91761065
0 references
0.9146146
0 references
0.91356343
0 references
0.9106742
0 references
0.9106548
0 references
0.9089021
0 references
0.9072016
0 references
