Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs (Q2482103): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5636932 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3428669 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On balanced graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Neighborhood Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Berge graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw-free graphs. III: Circular interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw-free graphs. IV: Decomposition theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bull-free Berge graphs are perfect / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of balanced matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On clique-transversals and clique-independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über iterierte Clique-Graphen / 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: Algorithmic aspects of clique-transversal and clique-independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighborhood perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernels in perfect line-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A description of claw-free perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4532752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Vertex Elimination on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Line perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reduction procedure for coloring perfect \(K_ 4\)-free graphs / rank
 
Normal rank

Latest revision as of 21:33, 27 June 2024

scientific article
Language Label Description Also known as
English
Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
scientific article

    Statements

    Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs (English)
    0 references
    0 references
    0 references
    16 April 2008
    0 references
    claw-free graphs
    0 references
    clique-perfect graphs
    0 references
    hereditary clique-Helly graphs
    0 references
    line graphs
    0 references
    perfect graphs
    0 references

    Identifiers