Improved Upper Bounds for Gallai-Ramsey Numbers of Paths and Cycles (Q2874090): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Edge-colorings avoiding rainbow and monochromatic subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey numbers for cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lambda composition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-colored complete graphs with precisely colored subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3565877 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gallai-Ramsey numbers for cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow generalizations of Ramsey theory: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitiv orientierbare Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge colorings of complete graphs without tricolored triangles / rank
 
Normal rank

Latest revision as of 07:38, 7 July 2024

scientific article
Language Label Description Also known as
English
Improved Upper Bounds for Gallai-Ramsey Numbers of Paths and Cycles
scientific article

    Statements

    Improved Upper Bounds for Gallai-Ramsey Numbers of Paths and Cycles (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    28 January 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    rainbow triangle
    0 references
    Gallai coloring
    0 references
    path
    0 references
    cycle
    0 references
    Gallai-Ramsey number
    0 references
    0 references