Three-colourable perfect graphs without even pairs (Q412165): 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: 05C17 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C15 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6030278 / 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
 
2-join
Property / zbMATH Keywords: 2-join / rank
 
Normal rank
Property / zbMATH Keywords
 
without even pairs
Property / zbMATH Keywords: without even pairs / rank
 
Normal rank
Property / zbMATH Keywords
 
without clique cutsets
Property / zbMATH Keywords: without clique cutsets / rank
 
Normal rank
Property / zbMATH Keywords
 
line graphs
Property / zbMATH Keywords: line graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
bipartite graphs
Property / zbMATH Keywords: bipartite graphs / rank
 
Normal rank

Revision as of 19:48, 29 June 2023

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