A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Analogous to cliques for (m,n)-colored mixed graphs
[article]

2015
*
arXiv
*
pre-print

Vertex coloring of a graph G with n-colors can be equivalently thought to be a graph homomorphism (edge preserving vertex mapping) of G to the complete graph K_n of order n. So, in that sense, the chromatic number χ(G) of G will be the order of the smallest complete graph to which G admits a homomorphism to. As every graph, which is not a complete graph, admits a homomorphism to a smaller complete graph, we can redefine the chromatic number χ(G) of G to be the order of the smallest graph to

arXiv:1411.7376v2
fatcat:lvryhvxwebfovk6k7de2x6kfyy