Coloring perfect graphs with no balanced skew-partitions (Q490982): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C70 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6474971 / rank
 
Normal rank
Property / zbMATH Keywords
 
perfect graphs
Property / zbMATH Keywords: perfect graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
Berge graphs
Property / zbMATH Keywords: Berge graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
maximum stable set
Property / zbMATH Keywords: maximum stable set / rank
 
Normal rank
Property / zbMATH Keywords
 
2-join
Property / zbMATH Keywords: 2-join / rank
 
Normal rank
Property / zbMATH Keywords
 
skew partition
Property / zbMATH Keywords: skew partition / rank
 
Normal rank
Property / zbMATH Keywords
 
homogeneous pair
Property / zbMATH Keywords: homogeneous pair / rank
 
Normal rank

Revision as of 21:45, 30 June 2023

scientific article
Language Label Description Also known as
English
Coloring perfect graphs with no balanced skew-partitions
scientific article

    Statements

    Coloring perfect graphs with no balanced skew-partitions (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 August 2015
    0 references
    perfect graphs
    0 references
    Berge graphs
    0 references
    maximum stable set
    0 references
    2-join
    0 references
    skew partition
    0 references
    homogeneous pair
    0 references

    Identifiers