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

DOI10.1007/S00373-024-02786-5MaRDI QIDQ6540643FDOQ6540643

Andrew Probert, Dillon Mayhew

Publication date: 17 May 2024

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

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

• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Triangulated graphs and the elimination process
• Reduced clique graphs of chordal graphs
• Title not available (Why is that?)
• A characterisation of rigid circuit graphs
• Clique Graphs of Chordal and Path Graphs
• On some simplicial elimination schemes for chordal graphs
• Minimal weak separators of chordal graphs.
• Enumeration of the perfect sequences of a chordal graph
• Chordal graphs and their clique graphs
• Supersolvable saturated matroids and chordal graphs

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)