(Theta, triangle)‐free and (even hole, K4)‐free graphs. Part 2: Bounds on treewidth (Q6080868)
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 7745579
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | (Theta, triangle)‐free and (even hole, K4)‐free graphs. Part 2: Bounds on treewidth |
scientific article; zbMATH DE number 7745579 |
Statements
(Theta, triangle)‐free and (even hole, K4)‐free graphs. Part 2: Bounds on treewidth (English)
0 references
4 October 2023
0 references
even-hole-free graph
0 references
maximum independent set
0 references
bounded treewidth
0 references
subdivided claw
0 references
0 references
0.8619353175163269
0 references
0.8360781669616699
0 references
0.8360490202903748
0 references
0.8291758894920349
0 references
0.800112783908844
0 references
