Almost all Berge Graphs are Perfect (Q4291185): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Enumeration of Partial Orders on a Finite Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakly triangulated graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: K l+1 -Free Graphs: Asymptotic Structure and a 0-1 Law / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluding Induced Subgraphs III: A General Asymptotic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluding induced subgraphs: quadrilaterals / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1017/s0963548300000079 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2137272630 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:33, 30 July 2024

scientific article; zbMATH DE number 563568
Language Label Description Also known as
English
Almost all Berge Graphs are Perfect
scientific article; zbMATH DE number 563568

    Statements

    Almost all Berge Graphs are Perfect (English)
    0 references
    0 references
    0 references
    30 May 1994
    0 references
    split graphs
    0 references
    perfect graphs
    0 references
    Berge graphs
    0 references
    strong perfect graph
    0 references

    Identifiers