Pages that link to "Item:Q5056112"
From MaRDI portal
The following pages link to The pathwidth and treewidth of cographs (Q5056112):
Displaying 16 items.
- Variable neighborhood search for the vertex separation problem (Q339678) (← links)
- Treewidth and pathwidth parameterized by the vertex cover number (Q344839) (← links)
- The micro-world of cographs (Q831855) (← links)
- On the pathwidth of chordal graphs (Q1309811) (← links)
- Treewidth of cocomparability graphs and a new order-theoretic parameter (Q1337573) (← links)
- Directed path-width and directed tree-width of directed co-graphs (Q1790979) (← links)
- A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs (Q1962057) (← links)
- Linear rank-width and linear clique-width of trees (Q2346380) (← links)
- Treewidth and Pathwidth Parameterized by the Vertex Cover Number (Q2842160) (← links)
- Mixed Search Number of Permutation Graphs (Q3507333) (← links)
- Treewidth and pathwidth of permutation graphs (Q4630253) (← links)
- Treewidth and Pathwidth of Permutation Graphs (Q4863978) (← links)
- Two strikes against perfect phylogeny (Q5204323) (← links)
- Tree-decompositions of small pathwidth (Q5916128) (← links)
- Reducing graph parameters by contractions and deletions (Q6119833) (← links)
- Tree-width and path-width of comparability graphs of interval orders (Q6184354) (← links)