Augmenting graphs for independent sets (Q705491): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2003.09.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2059553705 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithm for finding the largest independent sets in graphs without forks / rank
 
Normal rank
Property / cites work
 
Property / cites work: TWO THEOREMS IN GRAPH THEORY / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Recognition Algorithm for Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability number of bull- and chair-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On semi-\(P_ 4\)-sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trivially perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomially solvable cases for the maximum stable set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability in \(P_5\)- and banner-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4517443 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal independent sets of vertices in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms for the maximum stable set problem on particular classes of \(P_{5}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable sets in certain \(P_6\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-threshold graphs / rank
 
Normal rank

Latest revision as of 17:49, 7 June 2024

scientific article
Language Label Description Also known as
English
Augmenting graphs for independent sets
scientific article

    Statements

    Augmenting graphs for independent sets (English)
    0 references
    0 references
    0 references
    31 January 2005
    0 references
    0 references
    Independent set
    0 references
    Augmenting graph
    0 references
    Polynomial algorithm
    0 references
    0 references