Treewidth of cocomparability graphs and a new order-theoretic parameter

This publication has 8 references indexed in Scilit:

• On the pathwidth of chordal graphs
  Discrete Applied Mathematics, 1993
• The Pathwidth and Treewidth of Cographs
  SIAM Journal on Discrete Mathematics, 1993
• Interval dimension is a comparability invariant
  Discrete Mathematics, 1991
• A Linear Algorithm for the Pathwidth of Trees
  Published by Springer Nature ,1990
• Graph Problems Related to Gate Matrix Layout and PLA Folding
  Published by Springer Nature ,1990
• Complexity of Finding Embeddings in a k-Tree
  SIAM Journal on Algebraic Discrete Methods, 1987
• Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey
  BIT Numerical Mathematics, 1985
• A Characterization of Comparability Graphs and of Interval Graphs
  Canadian Journal of Mathematics, 1964