Coloring Artemis graphs (Q1019741): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3286847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfectly contractile graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even pairs in Berge graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3347930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2758333 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transformations which Preserve Perfectness and H-Perfectness of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakly triangulated graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Meyniel weakly triangulated graphs. I: Co-perfect orderability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Meyniel weakly triangulated graphs. II: A theorem of Dirac / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952597 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for weakly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Precoloring extension of co-Meyniel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4129482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of perfectly contractile graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Perfectly Contractile Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the perfect graph conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of recognizing perfectly orderable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust algorithms for restricted domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n^2)\) algorithm to color Meyniel graphs / rank
 
Normal rank

Latest revision as of 15:03, 1 July 2024

scientific article
Language Label Description Also known as
English
Coloring Artemis graphs
scientific article

    Statements

    Coloring Artemis graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 May 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    graph
    0 references
    coloring
    0 references
    perfect graph
    0 references
    even pair
    0 references
    algorithm
    0 references
    0 references