On a bound of Graham and Spencer for a graph-colouring constant
From MaRDI portal
Publication:2555862
DOI10.1016/0095-8956(73)90021-XzbMath0247.05119MaRDI QIDQ2555862
Publication date: 1973
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Related Items
Sur les R-coloriages minimaux, A Folkman Linear Family, Finding Folkman Numbers via MAX CUT Problem, Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- On Ramsey numbers and \(K_ r\)-coloring of graphs
- On edgewise 2-colored graphs with monochromatic triangles and containing no complete hexagon
- Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
- The Construction of Certain Graphs
- Combinatorial Relations and Chromatic Graphs