Chromatic number of some wheel related graphs


A proper coloring f is a b-coloring of the vertices of graph G such that in each color class there exists a vertex that has neighbours in every other color classes. The b-chromatic number φ (G) of a graph G is the largest integer k for which G admits a b-coloring with k colors. If χ (G) is the chromatic number of G and b-coloring exists for every integer k… (More)


  • Presentations referencing similar topics