Minimal separators of 2-chordal graphs

DOI10.1016/0024-3795(93)90378-2MaRDI QIDQ2365702zbMATH OpenOpenAlexFDO

Authors Scott McCullough

Publication date 29 June 1993

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0024-3795(93)90378-2

zbMATH Keywords

characterizationscliqueforbidden subgraphschordal graphminimal vertex separators2-chordal graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Recommendations

• Graphs with complete minimal \(k\)-vertex separators.
• Minimal relative separators of chordal graphs
• Independent separator graphs
• Minimal weak separators of chordal graphs.
• Minimal vertex separators of chordal graphs

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• Positive definite completions of partial Hermitian matrices
• Positive semidefinite matrices with a given sparsity pattern
• Schur products and matrix completions
• The Ranks of Extremal Positive Semidefinite Matrices with Given Sparsity Pattern

Cited in

(8)

• How to use the minimal separators of a graph for its chordal triangulation
• Graphs with complete minimal \(k\)-vertex separators.
• Applying clique-decomposition for computing Gromov hyperbolicity
• Minimal relative separators of chordal graphs
• scientific article; zbMATH DE number 4095519 (Why is no real title available?)
• Minimal weak separators of chordal graphs.
• Requiring that minimal separators induce complete multipartite subgraphs
• Minimal vertex separators and 3-skein subgraphs

This page was built for publication: Minimal separators of 2-chordal graphs

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