Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Entire DC Network
From Graph Coloring To Receptor Clustering, Ye Chen
From Graph Coloring To Receptor Clustering, Ye Chen
Graduate Theses, Dissertations, and Problem Reports
1. Hued colorings for planar graphs, graphs of higher genus and K4-minor free graphs.;For integers k, r > 0, a (k,r) -coloring of a graph G is a proper coloring of the vertices of G with k colors such that every vertex v of degree d(v) is adjacent to vertices with at least min{lcub}d(v) ,r{rcub} different colors. The r-hued chromatic number, denoted by Xr (G), is the smallest integer k for which a graph G has a ( k,r)-coloring. A list assignment L of G is a function that assigns to every vertex v of G a set L(v) of positive …