Minimal separators in extended \(P_4\)-laden graphs
type: Item
instance of: scholarly article
title: Minimal separators in extended \(P_4\)-laden graphs
zbMATH Open document ID: 1254.05189
author: Vagner Pedrotti
author: Célia P. de Mello
published in: Discrete Applied Mathematics
publication date: 2012-11-22T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 6109924
zbMATH Keywords: minimal separators
zbMATH Keywords: primeval decomposition
zbMATH Keywords: modular decomposition
zbMATH Keywords: graphs with few \(P_{4}\)'s
zbMATH Keywords: linear-time algorithms
MaRDI profile type: Publication
full work available at URL: j.dam.2012.01.025
OpenAlex ID: W2075197346
cites work: Complexity of Finding Embeddings in a k-Tree
cites work: GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
cites work: Recognizing weakly triangulated graphs by edge separability
cites work: Computing the treewidth and the minimum fill-in with the modular decomposition
cites work: Treewidth and minimum fill-in: Grouping the minimal separators
cites work: Listing all potential maximal cliques of a graph
cites work: \(P_{4}\)-laden graphs: A new class of brittle graphs
cites work: Q3836509
cites work: A New Class of Brittle Graphs
cites work: P-Components and the Homogeneous Decomposition of Graphs
cites work: Listing all Minimal Separators of a Graph
cites work: Minimal vertex separators of chordal graphs
cites work: Listing all the minimal separators of a 3-connected planar graph
cites work: Q3128916
cites work: Modular decomposition and transitive orientation
cites work: Minimal separators in \(P_4\)-sparse graphs
cites work: Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
cites work: Computing the Minimum Fill-In is NP-Complete
DOI: 10.1016/J.DAM.2012.01.025
description: scientific article; zbMATH DE number 6109924