Triangulation and Clique Separator Decomposition of Claw-Free Graphs

DOI10.1007/978-3-642-34611-8_5zbMATH Open1341.05199OpenAlexW1891220575MaRDI QIDQ5200490FDOQ5200490

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

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

Cited In (13)

• Organizing the atoms of the clique separator decomposition into an atom tree
• Title not available (Why is that?)
• Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
• On claw-free asteroidal triple-free graphs
• Graphs with at most two moplexes
• Computing a clique tree with the algorithm maximal label search
• Title not available (Why is that?)
• Disjoint cliques in claw-free graphs
• Decomposition of a Complete Multi-Partite Graph into Isomorphic Claws
• Title not available (Why is that?)
• Claw-free graphs. IV: Decomposition theorem
• On the \(d\)-claw vertex deletion problem
• Revisiting Decomposition by Clique Separators

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5200490)