Characterization of partial 3-trees in terms of three structures

DOI10.1007/BF01788098zbMath0609.05030OpenAlexW2013094585MaRDI QIDQ1086577

Shuichi Ueno, Yoji Kajitani, Akio Ishizuka

Publication date: 1986

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01788098

zbMATH Keywords

algorithmperfect eliminationk-treepartial k-trees

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (6)

The nonexistence of reduction rules giving an embedding into a \(k\)-tree ⋮ Graph decompositions and tree automata in reasoning with uncertainty ⋮ Constructive linear time algorithms for branchwidth ⋮ Minimum size tree-decompositions ⋮ Algorithms and obstructions for linear-width and related search parameters ⋮ Reduction algorithms for graphs of small treewidth

Cites Work

• Unnamed Item
• Unnamed Item
• Separating subgraphs in k-trees: Cables and caterpillars
• On simple characterizations of k-trees
• Steiner trees, partial 2–trees, and minimum IFI networks
• Networks immune to isolated failures
• Properties and characterizations of k ‐trees

This page was built for publication: Characterization of partial 3-trees in terms of three structures