All longest cycles in a 2‐connected partial 3‐tree share a common vertex (Q6047958)
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 7747697
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | All longest cycles in a 2‐connected partial 3‐tree share a common vertex |
scientific article; zbMATH DE number 7747697 |
Statements
All longest cycles in a 2‐connected partial 3‐tree share a common vertex (English)
0 references
10 October 2023
0 references
chordal graph
0 references
intersection
0 references
longest cycle
0 references
partial 3-tree
0 references
treewidth
0 references
0.8586038947105408
0 references
0.840918779373169
0 references
0.8155190348625183
0 references
0.8093701601028442
0 references
0.8091656565666199
0 references
