Chordal graphs and their clique graphs

DOI10.1007/3-540-60618-1_88MaRDI QIDQ6122237

Unnamed Author, Christophe Paul, Philippe Galinier

Publication date: 28 February 2024

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

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Computing the union join and subset graph of acyclic hypergraphs in subquadratic time ⋮ Quasi-optimal recombination operator ⋮ Unnamed Item ⋮ Recognizing Proper Tree-Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On rigid circuit graphs
• Weakly triangulated graphs
• Greedoids
• Some aspects of the semi-perfect elimination
• A characterisation of rigid circuit graphs
• Triangulated graphs and the elimination process
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• On the Desirability of Acyclic Database Schemes
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• A Fast Algorithm for Reordering Sparse Matrices for Parallel Factorization
• On the tree representation of chordal graphs
• Algorithmic Aspects of Vertex Elimination on Graphs