Beraha's Conjecture, Wheels, and Cyclic Graphs
Wolfram Demonstrations Project · 2007
A graph coloring assigns colors to the vertices of a graph in such a way that a pair of vertices joined by an edge do not get the same color The chromatic polynomial of a graph gives the number of ways of coloring the graph with colors Berahas numbers are Tutte conjectured that there is a link between Berahas numbers and some classes of graphs This Demonstration shows that for a small number of v