Graphs with complete minimal k-vertex separators.
From MaRDI portal
Publication:4897480
zbMATH Open1265.05516MaRDI QIDQ4897480FDOQ4897480
Authors: Terry A. McKee
Publication date: 19 December 2012
Recommendations
Extremal problems in graph theory (05C35) Connectivity (05C40) Structural characterization of families of graphs (05C75)
Cited In (13)
- GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
- Minimal separators of 2-chordal graphs
- 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
- Minimal weak separators of chordal graphs.
- Requiring that minimal separators induce complete multipartite subgraphs
- Graphs that have separator tree representations
- Minimal vertex separators and 3-skein subgraphs
- New graph classes characterized by weak vertex separators and two-pairs
- Some results on connected vertex separators
- When all minimal \(k\)-vertex separators induce complete or edgeless subgraphs
- When all minimal vertex separators induce complete or edgeless subgraphs
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)