Graphs with complete minimal k-vertex separators.

MaRDI QIDQ4897480zbMATHFDO

Authors Terry A. McKee

Publication date 19 December 2012

zbMATH Keywords

chordal graphforbidden induced subgraphminimal vertex separator

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40) Structural characterization of families of graphs (05C75)

Recommendations

• When all minimal \(k\)-vertex separators induce complete or edgeless subgraphs
• Independent separator graphs
• When all minimal vertex separators induce complete or edgeless subgraphs
• Minimal separators of 2-chordal graphs
• Minimal vertex separators and 3-skein subgraphs

Cited in

(13)

• Some results on connected vertex separators
• When all minimal vertex separators induce complete or edgeless subgraphs
• When all minimal \(k\)-vertex separators induce complete or edgeless subgraphs
• Graphs of separability at most two: structural characterizations and their consequences
• Requiring that minimal separators induce complete multipartite subgraphs
• Minimal separators of 2-chordal graphs
• Minimal vertex separators and 3-skein subgraphs
• Independent separator graphs
• Graphs that have separator tree representations
• Minimal weak separators of chordal graphs.
• New graph classes characterized by weak vertex separators and two-pairs
• GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
• On minimal vertex separators of dually chordal graphs: properties and characterizations

This page was built for publication: Graphs with complete minimal \(k\)-vertex separators.

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