Overview of Graph Colouring and some Ramsey-type Numbers

References (23)

1. 1 A new proof of Szemerédi's theorem [DOI]
2. 2 Some remarks on the theory of graphs [DOI]
3. 3 Small Ramsey Numbers [DOI]
4. 4 Combinatorial Relations and Chromatic Graphs [DOI]
5. 5 On the combinatorial problems which I would most like to see solved [DOI]
6. 6 A note on the independence number of triangle-free graphs [DOI]
7. 7 Ramsey's theorem—A new lower bound [DOI]
8. 8 On the total coloring of certain graphs [DOI]
9. 9 On Total Chromatic Number of a Graph [DOI]
10. 10 Dynamic concentration of the triangle-free process [DOI]
11. 11 Ramsey Theory on the Integers [DOI]
12. 12 A Bound on the Total Chromatic Number [DOI]
13. 13 A Construction for Partitions Which Avoid Long Arithmetic Progressions [DOI]
14. 14 The total coloring of a multigraph with maximal degree 4 [DOI]
15. 15 On edgewise 2-colored graphs with monochromatic triangles and containing no complete hexagon [DOI]
16. 16 A Lower Bound for Schur Numbers and Multicolor Ramsey Numbers [DOI]
17. 17 Symmetric Sum-Free Partitions and Lower Bounds for Schur Numbers [DOI]
18. 18 A Simple Proof of a Theorem of Erdös and Szekeres* [DOI]
19. 19 Dichromatic graphs and Ramsey numbers [DOI]
20. 20 Mathematical Logic and Computability
21. 21 Graph theory: a problem oriented approach [DOI]
22. 22 Some New Exact van der Waerden Numbers [DOI]
23. 23 The History of the Total Chromatic Number Conjecture [DOI]

Cited by 0

No indexed citations yet.

Related research

• Construction of Picture Maze along Set of Image Dot Vertices — shares topic coverage
• Survey on Unicast, Multicast and Broadcast Routing Techniques in Vehicular Ad-hoc Networks – Present and Future — shares topic coverage
• A Coalgebraic Model of Graphs — shares topic coverage
• Assessing Urban Road Network Connectivity Using GIS and Graph Theory in Lucknow, India — shares topic coverage