On a bound of Graham and Spencer for a graph-colouring constant (Q2555862): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring / 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: Combinatorial Relations and Chromatic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Ramsey numbers and \(K_ r\)-coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Construction of Certain Graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 11:53, 12 June 2024

scientific article
Language Label Description Also known as
English
On a bound of Graham and Spencer for a graph-colouring constant
scientific article

    Statements