Reduced clique graphs. A correction to: ``Chordal graphs and their clique graphs

DOI10.1007/S00373-024-02786-5MaRDI QIDQ6540643zbMATH OpenFDO

Authors Dillon Mayhew, Andrew Probert

Publication date 17 May 2024

Published in Graphs and Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00373-024-02786-5

zbMATH Keywords

chordal graphsinduced cyclesreduced clique graph

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Structural characterization of families of graphs (05C75) Conference proceedings and collections of articles (00Bxx)

Cites work

• scientific article; zbMATH DE number 554762 (Why is no real title available?)
• A characterisation of rigid circuit graphs
• Chordal graphs and their clique graphs
• Clique Graphs of Chordal and Path Graphs
• Enumeration of the perfect sequences of a chordal graph
• Minimal weak separators of chordal graphs.
• On some simplicial elimination schemes for chordal graphs
• Reduced clique graphs of chordal graphs
• Supersolvable saturated matroids and chordal graphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Triangulated graphs and the elimination process

This page was built for publication: Reduced clique graphs. A correction to: ``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 Q6540643)