Augmenting graphs for independent sets
type: Item
instance of: scholarly article
title: Augmenting graphs for independent sets
zbMATH Open document ID: 1056.05131
author: V. E. Alekseev
author: Vadim Lozin
published in: Discrete Applied Mathematics
publication date: 2005-01-31T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 2131567
zbMATH Keywords: Independent set
zbMATH Keywords: Augmenting graph
zbMATH Keywords: Polynomial algorithm
MaRDI profile type: Publication
full work available at URL: j.dam.2003.09.003
OpenAlex ID: W2059553705
cites work: Polynomial algorithm for finding the largest independent sets in graphs without forks
cites work: TWO THEOREMS IN GRAPH THEORY
cites work: A Linear Recognition Algorithm for Cographs
cites work: Stability number of bull- and chair-free graphs
cites work: Paths, Trees, and Flowers
cites work: On semi-\(P_ 4\)-sparse graphs
cites work: Trivially perfect graphs
cites work: Polynomially solvable cases for the maximum stable set problem
cites work: Stability in \(P_5\)- and banner-free graphs
cites work: Q4517443
cites work: On maximal independent sets of vertices in claw-free graphs
cites work: Polynomial algorithms for the maximum stable set problem on particular classes of \(P_{5}\)-free graphs
cites work: Stable sets in certain \(P_6\)-free graphs
cites work: Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
cites work: Quasi-threshold graphs
DOI: 10.1016/J.DAM.2003.09.003
description: scientific article; zbMATH DE number 2131567