Listing all the minimal separators of a 3-connected planar graph
type: Item
instance of: scholarly article
title: Listing all the minimal separators of a 3-connected planar graph
zbMATH Open document ID: 1086.05070
published in: Discrete Mathematics
publication date: 2006-03-29T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5016274
zbMATH Keywords: enumeration
zbMATH Keywords: algorithm
author: Frédéric Mazoit
MaRDI profile type: Publication
full work available at URL: j.disc.2005.12.007
OpenAlex ID: W1992510404
cites work: GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
cites work: Q4252036
cites work: Schnittverbände in Graphen. (Intersection lattices in graphs)
cites work: Q4942656
cites work: Listing all Minimal Separators of a Graph
cites work: Characterizations and algorithmic applications of chordal graph embeddings
cites work: Efficient enumeration of all minimal separators in a graph
DOI: 10.1016/J.DISC.2005.12.007
description: scientific article; zbMATH DE number 5016274