@article{(Open Science Index):https://publications.waset.org/pdf/9999407,
	  title     = {On Chromaticity of Wheels},
	  author    = {Zainab Yasir Al-Rekaby and  Abdul Jalil M. Khalaf},
	  country	= {},
	  institution	= {},
	  abstract     = {Let the vertices of a graph such that every two
adjacent vertices have different color is a very common problem in
the graph theory. This is known as proper coloring of graphs. The
possible number of different proper colorings on a graph with a given
number of colors can be represented by a function called the
chromatic polynomial. Two graphs G and H are said to be
chromatically equivalent, if they share the same chromatic
polynomial. A Graph G is chromatically unique, if G is isomorphic to
H for any graph H such that G is chromatically equivalent to H. The
study of chromatically equivalent and chromatically unique problems
is called chromaticity. This paper shows that a wheel W12 is
chromatically unique.
},
	    journal   = {International Journal of Mathematical and Computational Sciences},
	  volume    = {8},
	  number    = {8},
	  year      = {2014},
	  pages     = {1149 - 1152},
	  ee        = {https://publications.waset.org/pdf/9999407},
	  url   	= {https://publications.waset.org/vol/92},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 92, 2014},
	}