Strong clique trees, neighborhood trees, and strongly chordal graphs

DOI10.1002/(SICI)1097-0118(200003)33:3%3C151::AID-JGT5%3E3.0.CO;2-UMaRDI QIDQ4948510zbMATH OpenOpenAlexFDO

Authors Terry A. McKee

Publication date 19 November 2000

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(200003)33:3%3C151::aid-jgt5%3E3.0.co;2-u

zbMATH Keywords

clique treesstrongly chordal graph

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Hypergraphs (05C65)

Recommendations

• A new characterization of strongly chordal graphs
• A characterization of strongly chordal graphs
• Strengthening strongly chordal graphs
• Clique graph characterizations of strongly chordal graphs
• Odd twists on strongly chordal graphs

Cited in

(14)

• Characterizing and computing the structure of clique intersections in strongly chordal graphs
• Maxclique and unit disk characterizations of strongly chordal graphs
• Boxicity of leaf powers
• Odd twists on strongly chordal graphs
• Clique graph characterizations of strongly chordal graphs
• scientific article; zbMATH DE number 1990684 (Why is no real title available?)
• Detecting strong cliques
• Graphs that have separator tree representations
• Clique tree generalization and new subclasses of chordal graphs
• Strengthening strongly chordal graphs
• scientific article; zbMATH DE number 2230303 (Why is no real title available?)
• Subgraph trees in graph theory
• Strong tree-cographs are Birkhoff graphs
• Characterizing and computing the structure of clique intersections in strongly chordal graphs

This page was built for publication: Strong clique trees, neighborhood trees, and strongly chordal graphs

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