Treewidth of cocomparability graphs and a new order-theoretic parameter

1994/03/01 by Michel Habib, Rolf H. M�hring · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics #Discrete mathematics #Graph #Graph Labeling and Dimension Problems #Interconnection Networks and Systems #Line graph #Mathematics #Order (exchange) #Pathwidth #Treewidth

paper · doi:10.1007/bf01462229

crossref issued 1994/03/01 · crossref published 1994/03/01 · crossref published-print 1994/03/01 · openalex publication_date 1994/03/01 · crossref created 2005/04/13 · crossref deposited 2019/05/02 · openalex created_date 2025/10/10 · crossref indexed 2026/02/12 · openalex updated_date 2026/07/23

Citations

• Treewidth and pathwidth of permutation graphs
• Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey
• A Characterization of Comparability Graphs and of Interval Graphs
• Complexity of Finding Embeddings in a k-Tree
• Algorithmic Graph Theory and Perfect Graphs

Cited by

• Pathwidth [wikipedia]