751 search results - page 11 / 151 » The Distinguishing Chromatic Number |
71
Voted
DCG
2008
15 years 23 days ago
2008
86
Voted
SIAMDM
2008
15 years 19 days ago
2008
The first-fit chromatic number of a graph is the number of colors needed in the worst case of a greedy coloring. It is also called the Grundy number, which is defined to be the max...
108
Voted
JGT
2006
15 years 20 days ago
2006
Jeager et al introduced a concept of group connectivity as an generalization of nowhere zero flows and its dual concept group coloring, and conjectured that every 5-edge connected...
117
click to vote
CPC
2004
15 years 16 days ago
2004
The strong chromatic number, S(G), of an n-vertex graph G is the smallest number k such that after adding kn/k-n isolated vertices to G and considering any partition of the vertic...
189
Voted
MLQ
2011
14 years 7 months ago
2011
Given a graph G whose set of vertices is a Polish space X, the weak Borel chromatic number of G is the least size of a family of pairwise disjoint G-independent Borel sets that cov...