Canonical representations of partial 2-and 3-trees

DOI10.1007/3-540-52846-6_100zbMath1502.68200OpenAlexW1569786173MaRDI QIDQ5056113

Andrzej Proskurowski, Stefan Arnborg

Publication date: 9 December 2022

Published in: SWAT 90 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-52846-6_100

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Separating subgraphs in k-trees: Cables and caterpillars
• Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
• Linear time algorithms for NP-hard problems restricted to partial k- trees
• Lexicographically least circular substrings
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• A fast equivalence-checking algorithm for circular lists
• Triangulated graphs and the elimination process
• Steiner trees, partial 2–trees, and minimum IFI networks
• Characterization and Recognition of Partial 3-Trees
• Complexity of Finding Embeddings in a k-Tree
• Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs
• Recursive Graphs, Recursive Labelings and Shortest Paths

This page was built for publication: Canonical representations of partial 2-and 3-trees