scientific article; zbMATH DE number 17505

MaRDI QIDQ3974827zbMATH OpenFDO

Authors Shaohan Ma, Julin Wu

Publication date 26 June 1992

zbMATH Keywords

algorithmstrongly chordal graphsminimal relative separatorsseparator hypergraph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

Recommendations

• Minimal relative separators of chordal graphs
• A characterization of strongly chordal graphs
• Minimal weak separators of chordal graphs.
• A new characterization of strongly chordal graphs
• Minimal vertex separators of chordal graphs

Cited in

(7)

• Minimal vertex separators and new characterizations for dually chordal graphs
• Characterizing and computing the structure of clique intersections in strongly chordal graphs
• A characterization of strongly chordal graphs
• Minimal relative separators of chordal graphs
• Strong clique trees, neighborhood trees, and strongly chordal graphs
• Minimal weak separators of chordal graphs.
• Graphs that have separator tree representations

This page was built for publication:

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