Tree-width and path-width of comparability graphs of interval orders
From MaRDI portal
Recommendations
- Treewidth of cocomparability graphs and a new order-theoretic parameter
- Comparability graphs with constraint, partial semi-orders and interval orders
- Characterizations of treelike comparability graphs
- scientific article; zbMATH DE number 772777
- scientific article; zbMATH DE number 3902705
- Tree-Related Widths of Graphs and Hypergraphs
- scientific article; zbMATH DE number 3908482
- Graph-Theoretic Concepts in Computer Science
- The pathwidth and treewidth of cographs
- The Pathwidth and Treewidth of Cographs
Cites work
- A Characterization of Comparability Graphs and of Interval Graphs
- A linear-time recognition algorithm for interval dags
- Complexity of Finding Embeddings in a k-Tree
- Graph minors. I. Excluding a forest
- Graph minors. II. Algorithmic aspects of tree-width
- scientific article; zbMATH DE number 4174333 (Why is no real title available?)
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 176762 (Why is no real title available?)
- scientific article; zbMATH DE number 512918 (Why is no real title available?)
- scientific article; zbMATH DE number 566078 (Why is no real title available?)
- Scheduling Interval-Ordered Tasks
- The Pathwidth and Treewidth of Cographs
- Treewidth of cocomparability graphs and a new order-theoretic parameter
- Triangulating graphs without asteroidal triples
Cited in
(2)
This page was built for publication: Tree-width and path-width of comparability graphs of interval orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6184354)
