Reduced clique graphs. A correction to: ``Chordal graphs and their clique graphs
From MaRDI portal
Publication:6540643
DOI10.1007/s00373-024-02786-5MaRDI QIDQ6540643
Publication date: 17 May 2024
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Trees (05C05) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Conference proceedings and collections of articles (00Bxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Reduced clique graphs of chordal graphs
- Enumeration of the perfect sequences of a chordal graph
- 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 some simplicial elimination schemes for chordal graphs
- Clique Graphs of Chordal and Path Graphs
- 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