Independent Sets in Classes Related to Chair-Free Graphs (Q2795949): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On (\(P_{5}\), diamond)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum weight independent sets in hole- and dart-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Addendum to: ``Maximum weight independent sets in hole- and co-chair-free graphs'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent Sets of Maximum Weight in Apple-Free 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: Maximum weight independent sets in odd-hole-free graphs without dart or without bull / 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: On diameters and radii of bridged graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable sets in two subclasses of banner-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On atomic structure of \(P_5\)-free subclasses and maximum weight independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted independent sets in a subclass of \(P_6\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum weight independent sets in classes related to claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted independent sets in classes of \(P_6\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New sufficient conditions for \(\alpha\)-redundant vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum independent set problem in subclasses of \(S_{i, j, k}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm to find an independent set of maximum weight in a fork-free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding augmenting graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs without large apples and the maximum weight independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Maximum Independent Set Problem in Subclasses of Subcubic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets in extensions of 2\(K_{2}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on graphs without long induced paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular decomposition and transitive orientation / 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: Stable sets in certain \(P_6\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3575449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum weight independent sets in (\(P_6\), co-banner)-free graphs / 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 / cites work
 
Property / cites work: Decomposition by clique separators / rank
 
Normal rank

Latest revision as of 16:41, 11 July 2024

scientific article
Language Label Description Also known as
English
Independent Sets in Classes Related to Chair-Free Graphs
scientific article

    Statements

    Independent Sets in Classes Related to Chair-Free Graphs (English)
    0 references
    0 references
    23 March 2016
    0 references
    graph algorithms
    0 references
    independent sets
    0 references
    claw-free graphs
    0 references
    chair-free graphs
    0 references
    clique separators
    0 references
    modular decomposition
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references