Separating subgraphs in k-trees: Cables and caterpillars
From MaRDI portal
Publication:795842
DOI10.1016/0012-365X(84)90164-XzbMath0543.05041MaRDI QIDQ795842
Publication date: 1984
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Characterization of partial 3-trees in terms of three structures, Canonical representations of partial 2-and 3-trees, Clique tree generalization and new subclasses of chordal graphs, The monadic second-order logic of graphs. X: Linear orderings, Complexity of Finding Embeddings in a k-Tree, Unnamed Item, On the local and global mean orders of sub-\(k\)-trees of \(k\)-trees, On the structure and deficiency of \(k\)-trees with bounded degree, Forbidden minors characterization of partial 3-trees, On the extension of a partial metric to a tree metric, A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs, Intersection properties of boxes. II: Extremal families, The complexity of subgraph isomorphism for classes of partial k-trees, Canonical representations of partial 2- and 3-trees, Embeddings of \(k\)-connected graphs of pathwidth \(k\), Subclasses of \(k\)-trees: characterization and recognition, The triangles method to buildX-trees from incomplete distance matrices, Unnamed Item, A characterization of 2-tree probe interval graphs, Two strikes against perfect phylogeny, Minimum reload cost graph factors, Interior graphs of maximal outerplane graphs, k-separator chordal graphs: leafage and subfamilies, On some optimization problems on \(k\)-trees and partial \(k\)-trees, Minimal acyclic forbidden minors for the family of graphs with bounded path-width
Cites Work
