Minimal separators of 2-chordal graphs

DOI10.1016/0024-3795(93)90378-2zbMath0781.05043OpenAlexW1998905252MaRDI QIDQ2365702

Scott A. 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

characterizationscliquechordal graphforbidden subgraphsminimal vertex separators2-chordal graph

Mathematics Subject Classification ID

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

Related Items

Applying clique-decomposition for computing Gromov hyperbolicity

Cites Work

• Unnamed Item
• 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