On stable cutsets in line graphs
type: Item
instance of: scholarly article
title: On stable cutsets in line graphs
zbMATH Open document ID: 1022.68102
DOI: 10.1016/S0304-3975(03)00048-3
author: Van Bang Le
author: Bert Randerath
published in: Theoretical Computer Science
publication date: 2003-07-30T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1957357
zbMATH Keywords: stable sets
zbMATH Keywords: cutsets
zbMATH Keywords: line graphs
zbMATH Keywords: decomposable graphs
MaRDI profile type: Publication
cites work: On stable cutsets in graphs
cites work: A note on fragile graphs
cites work: Recognizing decomposable graphs
cites work: Stable set bonding in perfect graphs and parity graphs
cites work: Q3872508
cites work: Q4393307
cites work: An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
cites work: Q4083461
cites work: Matching cutsets in graphs
cites work: A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
cites work: Decomposition by clique separators
cites work: Coloring graphs with stable cutsets
cites work: An algorithm for finding clique cut-sets
description: scientific article; zbMATH DE number 1957357