When all minimal k-vertex separators induce complete or edgeless subgraphs

MaRDI QIDQ5740775zbMATH OpenFDO

Authors Terry A. McKee

Publication date 20 July 2016

zbMATH Keywords

chordal graphsindependent set

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

• Graphs with complete minimal \(k\)-vertex separators.
• When all minimal vertex separators induce complete or edgeless subgraphs
• Independent separator graphs
• Minimal vertex separators and 3-skein subgraphs
• Requiring that minimal separators induce complete multipartite subgraphs

Cited in

(10)

• Minimal vertex separators and new characterizations for dually chordal graphs
• Graphs with complete minimal \(k\)-vertex separators.
• Graphs of separability at most two: structural characterizations and their consequences
• On minimal vertex separators of dually chordal graphs: properties and characterizations
• Independent separator graphs
• Requiring that minimal separators induce complete multipartite subgraphs
• Minimal vertex separators and 3-skein subgraphs
• New graph classes characterized by weak vertex separators and two-pairs
• On the minimum number of edge‐disjoint complete m‐partite subgraphs into which K_n can be decomposed
• When all minimal vertex separators induce complete or edgeless subgraphs

This page was built for publication: When all minimal \(k\)-vertex separators induce complete or edgeless subgraphs

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