Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences (Q412344): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Q3286847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On algorithms for (\(P_5\), gem)-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 clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of (\(P_{5}\),\,gem)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplicial powers of 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: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5463359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On distance-3 matchings and induced matchings / 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: Characterising \((k,\ell )\)-leaf powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a maximum induced matching in weakly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / 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: On rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs without a \(C_{4}\) or a diamond / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect Elimination and Chordal Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrigendum to our paper ''The ellipsoid method and its consequences in combinatorial optimization'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3271426 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Doubly Lexical Orderings of Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics in Intersection Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Partition Refinement Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Doubly lexical ordering of dense 0--1 matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition by clique separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even-hole-free graphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5184933 / rank
 
Normal rank

Latest revision as of 03:03, 5 July 2024

scientific article
Language Label Description Also known as
English
Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
scientific article

    Statements

    Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences (English)
    0 references
    0 references
    0 references
    0 references
    4 May 2012
    0 references
    clique separator decomposition
    0 references
    hole-free and diamond-free graphs
    0 references
    hole-free and paraglider-free graphs
    0 references
    perfect graphs
    0 references
    efficient algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers