The Maximum Weight Stable Set Problem in ( $$P_6$$ , bull)-Free Graphs (Q3181049): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
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: Q3286847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5387674 / 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 structure of bull-free graphs I -- three-edge-paths with centers and anticenters / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of bull-free graphs II and III -- a summary / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handle-rewriting hypergraph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing Bull-Free Perfect Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of bull-free perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4944973 / 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: Weighted independent sets in classes of \(P_6\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence and Efficient Domination on <i>P</i><sub>6</sub>-free Graphs / 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: Independent sets in extensions of 2\(K_{2}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 4-coloring \((P_6, \text{bull})\)-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: Coloring Bull-Free Perfect Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing bull-free perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial Turing-kernel for weighted independent set in bull-free graphs / rank
 
Normal rank

Latest revision as of 05:32, 13 July 2024

scientific article
Language Label Description Also known as
English
The Maximum Weight Stable Set Problem in ( $$P_6$$ , bull)-Free Graphs
scientific article

    Statements

    The Maximum Weight Stable Set Problem in ( $$P_6$$ , bull)-Free Graphs (English)
    0 references
    0 references
    0 references
    22 December 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    stability
    0 references
    \(P_6\)-free graph
    0 references
    bull-free graph
    0 references
    polynomial time algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references