Three-colourable perfect graphs without even pairs (Q412165): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Recognizing Berge graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even pairs in 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: \(K_{4}\)-free graphs with no odd holes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2758333 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4810376 / rank
 
Normal rank
Property / cites work
 
Property / cites work: About skew partitions in minimal imperfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical perfect graphs and perfect 3-chromatic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3680855 / rank
 
Normal rank
Property / cites work
 
Property / cites work: K4-free graphs with no odd hole: Even pairs and the circular chromatic number / rank
 
Normal rank

Latest revision as of 03:59, 5 July 2024

scientific article
Language Label Description Also known as
English
Three-colourable perfect graphs without even pairs
scientific article

    Statements

    Three-colourable perfect graphs without even pairs (English)
    0 references
    0 references
    0 references
    4 May 2012
    0 references
    0 references
    perfect graphs
    0 references
    Berge graphs
    0 references
    2-join
    0 references
    without even pairs
    0 references
    without clique cutsets
    0 references
    line graphs
    0 references
    bipartite graphs
    0 references
    0 references