Overview of Graph Colouring and some Ramsey-type Numbers
Benjamin Fraser & Tzvetalin S. Vassilev · Journal of Advances in Mathematics and Computer Science · 2014
We introduce the concept of graph colouring and discuss some classical results in this area. In particular, we consider the problem of finding the minimal graphs, complete or not, whose vertex or edge colouring contains or avoids certain subgraphs. This is generally known as Rams...
Open access
Research Article
10.9734/BJMCS/2015/14231