1st Annual UMR Undergraduate Research Symposium (1991: Apr., Rolla, MO)
The composite graph is a finite undirected graph G with no loops and no multiple edges and with positive integers associated with each vertex of G. The number of integers associated with each vertex is the chromaticity of the vertex. The chromatic degree of a vertex v is the sum of the chromaticity of v and the chromaticities of all vertices adjacent to v. The graph G is a v-composite graph if the chromaticities are not equal.
Improving Technology Through Computer Modeling
Alons, Kevin, "Simulated Annealing on the Composite Graph Coloring Problem" (1991). Opportunities for Undergraduate Research Experience Program (OURE). 117.