Listing all the minimal separators of a 3-connected planar graph
From MaRDI portal
Publication:819830
DOI10.1016/j.disc.2005.12.007zbMath1086.05070OpenAlexW1992510404MaRDI QIDQ819830
Publication date: 29 March 2006
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2005.12.007
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (3)
Minimal separators in extended \(P_4\)-laden graphs ⋮ Solution methods for the vertex variant of the network system vulnerability analysis problem ⋮ Minimal separators in <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>P</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:math>-tidy graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Characterizations and algorithmic applications of chordal graph embeddings
- Efficient enumeration of all minimal separators in a graph
- Schnittverbände in Graphen. (Intersection lattices in graphs)
- Listing all Minimal Separators of a Graph
- GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
This page was built for publication: Listing all the minimal separators of a 3-connected planar graph
