Independent sets in extensions of 2\(K_{2}\)-free graphs (Q1765375): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: On easy and hard hereditary classes of graphs with respect to the independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On (\(P_{5}\), diamond)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent domination in finitely defined classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An augmenting graph approach to the stable set problem in \(P_{5}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization. / 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: On domination problems for permutation and other graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(\alpha\)-redundant vertices in \(P_{5}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on \(\alpha\)-redundant vertices in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On variations of \(P_{4}\)-sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure and stability number of \(P_{5}\)- and co-chair-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent domination in chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On diameters and radii of bridged graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound on the number of cliques in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition for a class of \((P_ 5,\overline{P}_ 5)\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs without \(P_ 5\) and \(\overline {P}_ 5\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On semi-\(P_ 4\)-sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting chains in graphs without a skew star. / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(P_{5}\)-free augmenting graphs and the maximum stable set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the stable set problem in special \(P_{5}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted parameters in \((P_5,\overline {P_5})\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On extended \(P_4\)-reducible and extended \(P_4\)-sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding augmenting chains in extensions of claw-free graphs / 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: 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: Some results on maximum stable sets in certain \(P_{5}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871056 / 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: A New Algorithm for Generating All the Maximal Independent Sets / rank
 
Normal rank

Latest revision as of 17:49, 7 June 2024

scientific article
Language Label Description Also known as
English
Independent sets in extensions of 2\(K_{2}\)-free graphs
scientific article

    Statements

    Independent sets in extensions of 2\(K_{2}\)-free graphs (English)
    0 references
    0 references
    0 references
    23 February 2005
    0 references
    Maximal stable set
    0 references
    Polynomial-time algorithm
    0 references
    0 references
    0 references

    Identifiers