On Ramsey numbers and \(K_ r\)-coloring of graphs (Q2550031): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3851094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Relations and Chromatic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of Special Edge-Chromatic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A uniqueness theorem for edge-chromatic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds for some Ramsey numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some graph theoretic results associated with Ramsey's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On edgewise 2-colored graphs with monochromatic triangles and containing no complete hexagon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5616720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring / rank
 
Normal rank

Latest revision as of 09:35, 12 June 2024

scientific article
Language Label Description Also known as
English
On Ramsey numbers and \(K_ r\)-coloring of graphs
scientific article

    Statements

    Identifiers