Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions (Q2264683): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Graph Theory and Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a theorem of Rademacher-Turán / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5543308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5578805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5544083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal paths and circuits of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5567712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extremal graph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On chromatic number of finite set-systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5548826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extremal graph problem of the icosahedron / rank
 
Normal rank

Revision as of 12:52, 12 June 2024

scientific article
Language Label Description Also known as
English
Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
scientific article

    Statements

    Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions (English)
    0 references
    1974
    0 references

    Identifiers