Triangulation and Clique Separator Decomposition of Claw-Free Graphs

DOI10.1007/978-3-642-34611-8_5zbMath1341.05199OpenAlexW1891220575MaRDI QIDQ5200490

Anne Berry, Annegret K. Wagler

Publication date: 6 November 2012

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-34611-8_5

zbMATH Keywords

claw-free graphminimal triangulationclique separator decomposition

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Computing a clique tree with the algorithm maximal label search ⋮ Organizing the atoms of the clique separator decomposition into an atom tree ⋮ Revisiting Decomposition by Clique Separators ⋮ Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds

This page was built for publication: Triangulation and Clique Separator Decomposition of Claw-Free Graphs