Perfect Graphs with No Balanced Skew-Partition are 2-Clique-Colorable (Q2800540): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Clique-transversal sets of line graphs and complements of line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring the Maximal Cliques of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of derived graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Berge trigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of bull-free graphs I -- three-edge-paths with centers and anticenters / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of bull-free graphs II and III -- a summary / 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. V. Global structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-coloring some classes of odd-hole-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of clique-coloring odd-hole-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-colouring all two-element maximal antichains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitiv orientierbare Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring the hypergraph of maximal cliques of a graph with no long path / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-stable set separation in perfect graphs with no balanced skew-partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur le coloriage des graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost all Berge Graphs are Perfect / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing Berge graphs and detecting balanced skew partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization with 2-joins / rank
 
Normal rank

Latest revision as of 20:05, 11 July 2024

scientific article
Language Label Description Also known as
English
Perfect Graphs with No Balanced Skew-Partition are 2-Clique-Colorable
scientific article

    Statements

    Perfect Graphs with No Balanced Skew-Partition are 2-Clique-Colorable (English)
    0 references
    0 references
    0 references
    15 April 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    strong perfect graph theorem
    0 references
    clique-chromatic number
    0 references
    0 references