Characterizing and computing the structure of clique intersections in strongly chordal graphs

DOI10.1016/j.dam.2014.09.003zbMath1304.05107OpenAlexW2002621149MaRDI QIDQ479046

Christian Rosenke, Ragnar Nevries

Publication date: 5 December 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2014.09.003

zbMATH Keywords

characterizationchordal graphstrongly chordal graphclique treeclique arrangementclique separator graph

Mathematics Subject Classification ID

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

Related Items

MAT-free graphic arrangements and a characterization of strongly chordal graphs by edge-labeling ⋮ Mutual transferability for \((F, B, R)\)-domination on strongly chordal graphs and cactus graphs

Cites Work

• Towards a characterization of leaf powers by clique arrangements
• On rigid circuit graphs
• The clique-separator graph for chordal graphs
• Characterizations of strongly chordal graphs
• Counting clique trees and computing perfect elimination schemes in parallel
• Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs
• Incidence matrices and interval graphs
• Triangulated graphs and the elimination process
• On Graph Powers for Leaf-Labeled Trees
• Degrees of acyclicity for hypergraphs and relational database schemes
• On the tree representation of chordal graphs
• Three Partition Refinement Algorithms
• Power of Natural Semijoins
• Topics in Intersection Graph Theory
• Graph Classes: A Survey
• Strong clique trees, neighborhood trees, and strongly chordal graphs
• Algorithms and Computation
• Unnamed Item
• Unnamed Item