Old Web
English
Sign In
Acemap
>
Paper
>
(Theta, triangle)‐free and (even hole, K4)‐free graphs. Part 2: Bounds on treewidth
(Theta, triangle)‐free and (even hole, K4)‐free graphs. Part 2: Bounds on treewidth
2021
Marcin Pilipczuk
Ni Luh Dewi Sintiari
Stéphan Thomassé
Nicolas Trotignon
Keywords:
Mathematics
Combinatorics
Independent set
Treewidth
Even-hole-free graph
Correction
Source
Cite
Save
Machine Reading By IdeaReader
15
References
2
Citations
NaN
KQI
[]