Pages that link to "Item:Q987668"
From MaRDI portal
The following pages link to A bound on the treewidth of planar even-hole-free graphs (Q987668):
Displayed 7 items.
- Structure and algorithms for (cap, even hole)-free graphs (Q1685999) (← links)
- On the tree-width of even-hole-free graphs (Q1979431) (← links)
- Induced subgraphs and tree decompositions. I: Even-hole-free graphs of bounded degree (Q2171016) (← links)
- A faster algorithm to recognize even-hole-free graphs (Q2347846) (← links)
- Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure (Q5013568) (← links)
- Finding a shortest even hole in polynomial time (Q6057650) (← links)
- A class of graphs with large rankwidth (Q6080165) (← links)