Pages that link to "Item:Q1337573"
From MaRDI portal
The following pages link to Treewidth of cocomparability graphs and a new order-theoretic parameter (Q1337573):
Displayed 12 items.
- Computing directed pathwidth in \(O(1.89^n)\) time (Q300464) (← links)
- Treewidth and minimum fill-in on permutation graphs in linear time (Q708222) (← links)
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity (Q724225) (← links)
- Triangulating graphs with few \(P_4\)'s (Q1281383) (← links)
- On treewidth and minimum fill-in of asteroidal triple-free graphs (Q1392207) (← links)
- Triangulating multitolerance graphs (Q1392575) (← links)
- Counting linear extensions: parameterizations by treewidth (Q1739113) (← links)
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778) (← links)
- Triangulating graphs without asteroidal triples (Q1917255) (← links)
- A Characterisation of the Minimal Triangulations of Permutation Graphs (Q3508558) (← links)
- Approximating Pathwidth for Graphs of Small Treewidth (Q6075751) (← links)
- Tree-width and path-width of comparability graphs of interval orders (Q6184354) (← links)