Tree-width and path-width of comparability graphs of interval orders

DOI10.1007/3-540-59071-4_35zbMath1528.68289MaRDI QIDQ6184354

Unnamed Author

Publication date: 5 January 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Graph minors. I. Excluding a forest
• A linear-time recognition algorithm for interval dags
• Treewidth of cocomparability graphs and a new order-theoretic parameter
• Triangulating graphs without asteroidal triples
• Graph minors. II. Algorithmic aspects of tree-width
• Complexity of Finding Embeddings in a k-Tree
• Scheduling Interval-Ordered Tasks
• The Pathwidth and Treewidth of Cographs
• A Characterization of Comparability Graphs and of Interval Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Tree-width and path-width of comparability graphs of interval orders