Characterizing and Computing the Structure of Clique Intersections in Strongly Chordal Graphs

DOI10.1007/978-3-642-45043-3_33zbMath1417.05156OpenAlexW1879675207MaRDI QIDQ2864317

Christian Rosenke, Ragnar Nevries

Publication date: 6 December 2013

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-45043-3_33

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Towards a characterization of leaf powers by clique arrangements

This page was built for publication: Characterizing and Computing the Structure of Clique Intersections in Strongly Chordal Graphs