Clique graph characterizations of strongly chordal graphs

MaRDI QIDQ5401055zbMATH OpenFDO

Authors Terry A. McKee

Publication date 12 March 2014

zbMATH Keywords

perfect graphscomponent-complete graphs

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Paths and cycles (05C38)

Recommendations

• A new characterization of strongly chordal graphs
• A characterization of strongly chordal graphs
• Strong clique trees, neighborhood trees, and strongly chordal graphs
• Publication:3203055
• scientific article; zbMATH DE number 4093512

Cited in

(13)

• Dominating cliques in chordal graphs
• Maxclique and unit disk characterizations of strongly chordal graphs
• Strong Chordality of Graphs with Possible Loops
• scientific article; zbMATH DE number 2096431 (Why is no real title available?)
• A characterization of strongly chordal graphs
• Characterization of classical graph classes by weighted clique graphs
• Strengthening strongly chordal graphs
• Edge clique graphs and some classes of chordal graphs
• On weighted clique graphs
• scientific article; zbMATH DE number 4077265 (Why is no real title available?)
• Strong cliques and equistability of EPT graphs
• The clique-separator graph for chordal graphs
• Strong cliques in vertex‐transitive graphs

This page was built for publication: Clique graph characterizations of strongly chordal graphs

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