Overview of Graph Colouring and some Ramsey-type Numbers
Benjamin Fraser, Tzvetalin S. Vassilev
Journal of Advances in Mathematics and Computer Science · pp. 414–428 · Published 14 Nov 2014
10.9734/BJMCS/2015/14231Abstract
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 Ramsey theory. We give short proofs of some elementary results in this area, and discuss their relationship to colouring integer sequences.
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
Article metrics
Real usage data collected on this platform.
0
Page views
0
PDF downloads
0
Outbound clicks
0
Citations
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
No views recorded yet.
Traffic sources
Referring site, by host.
No traffic recorded yet.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.