Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs (Q1025541): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Clique graphs and Helly graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5605753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5636932 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3439668 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization and recognition of Helly circular-arc clique-perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3428669 / 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: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Neighborhood Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Graphs Without Multicliqual Edges / 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: Recognizing balanceable matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5708496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for finding clique-transversals of graphs / 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: Algorithms on circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / 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: Distance-hereditary graphs are clique-perfect / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighborhood perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On clique-complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3980562 / rank
 
Normal rank

Latest revision as of 17:11, 1 July 2024

scientific article
Language Label Description Also known as
English
Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
scientific article

    Statements

    Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs (English)
    0 references
    0 references
    0 references
    19 June 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    clique-perfect graphs
    0 references
    diamond-free graphs
    0 references
    Helly circular-arc graphs
    0 references
    k-perfect graphs
    0 references
    perfect graphs
    0 references
    0 references