Extremal Graph Problems for Graphs with a Color-Critical Vertex (Q4290097): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An extremal graph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Structure of Edge 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: Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymptotic number of graphs not containing a fixed color-critical subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring Clique-free Graphs in Linear Expected Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3312262 / rank
 
Normal rank

Latest revision as of 14:21, 22 May 2024

scientific article; zbMATH DE number 558812
Language Label Description Also known as
English
Extremal Graph Problems for Graphs with a Color-Critical Vertex
scientific article; zbMATH DE number 558812

    Statements

    Extremal Graph Problems for Graphs with a Color-Critical Vertex (English)
    0 references
    0 references
    0 references
    0 references
    28 April 1994
    0 references
    chromatic number
    0 references
    random graph
    0 references
    critical vertex
    0 references

    Identifiers