Chordal graphs and their clique graphs

DOI10.1007/3-540-60618-1_88MaRDI QIDQ6122237zbMATH OpenFDO

Authors P. Galinier, Michel Habib, Christophe Paul

Publication date 28 February 2024

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

Full work available at URL https://doi.org/10.1007/3-540-60618-1_88

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 554762
• On the tree representation of chordal graphs
• Efficient Parallel Algorithms for Chordal Graphs
• Clique tree generalization and new subclasses of chordal graphs
• On some simplicial elimination schemes for chordal graphs

Cites work

• A characterisation of rigid circuit graphs
• A Fast Algorithm for Reordering Sparse Matrices for Parallel Factorization
• Algorithmic Aspects of Vertex Elimination on Graphs
• Greedoids
• scientific article; zbMATH DE number 43754 (Why is no real title available?)
• scientific article; zbMATH DE number 554762 (Why is no real title available?)
• On rigid circuit graphs
• On the Desirability of Acyclic Database Schemes
• On the tree representation of chordal graphs
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Some aspects of the semi-perfect elimination
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Triangulated graphs and the elimination process
• Weakly triangulated graphs

Cited in

(10)

• Quasi-optimal recombination operator
• Recognizing Proper Tree-Graphs
• scientific article; zbMATH DE number 7764121 (Why is no real title available?)
• Reduced clique graphs. A correction to: ``Chordal graphs and their clique graphs
• Decoding tree decompositions from permutations
• A new characterization of \(k\)-trees and some applications
• Multicore graphs: characterization and properties
• Polynomial kernels for edge modification problems towards block and strictly chordal graphs
• Partial search orderings for MCS on chordal graphs via clique graph decomposition
• Computing the union join and subset graph of acyclic hypergraphs in subquadratic time

This page was built for publication: Chordal graphs and their clique graphs

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