Stable sets in two subclasses of banner-free graphs (Q1414588): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Vadim V. Lozin / rank
Normal rank
 
Property / author
 
Property / author: Vadim V. Lozin / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Augmenting graphs for independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the stability number of claw-free \(P_5\)-free and more general graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of generalized clique packing / 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: Robust algorithms for the stable set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Representatives of Subsets / 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: Q4229265 / 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: Computing independent sets in graphs with large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770411 / 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0166-218x(03)00395-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2079563996 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:38, 30 July 2024

scientific article
Language Label Description Also known as
English
Stable sets in two subclasses of banner-free graphs
scientific article

    Statements

    Stable sets in two subclasses of banner-free graphs (English)
    0 references
    0 references
    0 references
    0 references
    4 December 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Stable set
    0 references
    Augmenting graphs
    0 references
    Polynomial algorithm
    0 references
    0 references