Existence of 3-factors in \(K_{1,n}\)-free graphs with connectivity and edge-connectivity conditions (Q4990110)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7352020
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Existence of 3-factors in \(K_{1,n}\)-free graphs with connectivity and edge-connectivity conditions |
scientific article; zbMATH DE number 7352020 |
Statements
28 May 2021
0 references
connectivity
0 references
edge-connectivity
0 references
3-factor
0 references
minimum degree
0 references
0 references
0.917578935623169
0 references
0.8592343330383301
0 references
0.8592343330383301
0 references
0.8580787181854248
0 references
0.8504800796508789
0 references
