On independent vertex sets in subclasses of apple-free graphs (Q848838): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Andreas Brandstädt / rank
Normal rank
 
Property / author
 
Property / author: Vadim V. Lozin / rank
Normal rank
 
Property / author
 
Property / author: Andreas Brandstädt / 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-008-9176-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1972321305 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting graphs for independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On linear and circular structure of (claw, net)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem / 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: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Algorithms for Hamiltonian Problems on (Claw,Net)-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New applications of clique separator decomposition for the maximum weight stable set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3416248 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / 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 the vertex packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3918148 / 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: Stable sets in two subclasses of banner-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / 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: The struction of a graph: Application to CN-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hamiltonicity of \{claw, net\}-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: Q2934676 / 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: Q3683903 / 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: Stable sets of maximum weight in (\(P_{7}\), banner)-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: The strong perfect graph conjecture for pan-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient graph representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition by clique separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686753 / rank
 
Normal rank

Latest revision as of 12:13, 2 July 2024

scientific article
Language Label Description Also known as
English
On independent vertex sets in subclasses of apple-free graphs
scientific article

    Statements

    On independent vertex sets in subclasses of apple-free graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    23 February 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    apple-free graphs
    0 references
    clique separators
    0 references
    nearly perfect graphs
    0 references
    nearly chordal graphs
    0 references
    efficient algorithms
    0 references
    maximum weight independent set problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references