Canonical representations of partial 2- and 3-trees
type: Item
instance of: scholarly article
title: Canonical representations of partial 2- and 3-trees
zbMATH Open document ID: 0761.68072
DOI: 10.1007/BF01994877
author: Stefan Arnborg
author: Andrzej Proskurowski
published in: BIT
publication date: 1992-12-14T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 79059
zbMATH Keywords: canonical representation of graphs
MaRDI profile type: Publication
cites work: Q4091421
cites work: Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
cites work: Complexity of Finding Embeddings in a k-Tree
cites work: An algebraic theory of graph reduction
cites work: Characterization and Recognition of Partial 3-Trees
cites work: Linear time algorithms for NP-hard problems restricted to partial k- trees
cites work: Q3796771
cites work: Q3097395
cites work: Lexicographically least circular substrings
cites work: Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs
cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
cites work: Q4120604
cites work: Q4148000
cites work: The nonexistence of reduction rules giving an embedding into a \(k\)-tree
cites work: Isomorphism of graphs of bounded valence can be tested in polynomial time
cites work: Recursive Graphs, Recursive Labelings and Shortest Paths
cites work: Separating subgraphs in k-trees: Cables and caterpillars
cites work: Graph minors. V. Excluding a planar graph
cites work: On simple characterizations of k-trees
cites work: Q5677651
cites work: Q3766846
cites work: A fast equivalence-checking algorithm for circular lists
cites work: Steiner trees, partial 2–trees, and minimum IFI networks
cites work: Q3826618
description: scientific article; zbMATH DE number 79059