751 search results - page 7 / 151 » The Distinguishing Chromatic Number |
DM
1998
15 years 11 days ago
1998
The total chromatic number zt(G) of a graph G is the least number of colors needed to color the vertices and edges of G so that no adjacent vertices or edges receive the same colo...
109
Voted
GD
2005
Springer
15 years 6 months ago
2005
Springer
Let S be a set of horizontal line segments, or bars, in the plane. We say that G is a bar visibility graph, and S its bar visibility representation, if there exists a one-to-one co...
78
Voted
JCT
2007
15 years 18 days ago
2007
74
Voted
JGT
2010
14 years 11 months ago
2010
: We consider a problem related to Hadwiger’s Conjecture. Let
76
Voted
DM
2006
15 years 22 days ago
2006
For an integer r > 0, a conditional (k, r)-coloring of a graph G is a proper k-coloring of the vertices of G such that every vertex of degree at least r in G will be adjacent t...