The Pathwidth and Treewidth of Cographs
From MaRDI portal
Publication:4695381
DOI10.1137/0406014zbMath0773.05091MaRDI QIDQ4695381
Rolf H. Möhring, Hans L. Bodlaender
Publication date: 21 July 1993
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://dspace.library.uu.nl/handle/1874/16625
05C05: Trees
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
On intervalizing \(k\)-colored graphs for DNA physical mapping, The complexity of subgraph isomorphism for classes of partial k-trees, An optimal parallel algorithm for node ranking of cographs, A partial k-arboretum of graphs with bounded treewidth, Triangulating graphs with few \(P_4\)'s, Partial and perfect path covers of cographs, Treewidth of cocomparability graphs and a new order-theoretic parameter, Treewidth for graphs with small chordality, Characterizations and algorithmic applications of chordal graph embeddings, On interval routing schemes and treewidth, Fugitive-search games on graphs and related parameters, Triangulating multitolerance graphs, Edge and node searching problems on trees, The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs, Triangulating graphs without asteroidal triples
