Independent sets in some classes of \(S_{i,j,k}\)-free graphs (Q2410110): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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/s10878-016-0096-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2552678279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On (\(P_{5}\), diamond)-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: On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem / 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: 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 the maximum independent set problem in subclasses of subcubic 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: Independent Sets in Classes Related to Chair-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: Maximum Weight Independent Sets in ( $$S_{1,1,3}$$ , bull)-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: Independent Set in <i>P</i><sub>5</sub>-Free Graphs in Polynomial Time / 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: 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: Classes of subcubic planar graphs for which the independent set problem is polynomially solvable / 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: 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:22, 14 July 2024

scientific article
Language Label Description Also known as
English
Independent sets in some classes of \(S_{i,j,k}\)-free graphs
scientific article

    Statements

    Independent sets in some classes of \(S_{i,j,k}\)-free graphs (English)
    0 references
    0 references
    17 October 2017
    0 references
    graph algorithms
    0 references
    independent sets
    0 references
    claw-free graphs
    0 references
    fork-free graphs
    0 references
    0 references
    0 references

    Identifiers