On 2-factors with long cycles in 3-connected claw-free graphs (Q6570036)
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 with long cycles in 3-connected claw-free graphs |
scientific article; zbMATH DE number 7879053
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On 2-factors with long cycles in 3-connected claw-free graphs |
scientific article; zbMATH DE number 7879053 |
Statements
On 2-factors with long cycles in 3-connected claw-free graphs (English)
0 references
10 July 2024
0 references
claw-free graph
0 references
cycles
0 references
2-factor
0 references
closed trail
0 references
minimum degree
0 references
0 references
0.8956721425056458
0 references
0.8951650261878967
0 references
0.8931142687797546
0 references
0.8867733478546143
0 references
0.8696354031562805
0 references
