1302 search results - page 32 / 261 » On the Strong Chromatic Number |
158
click to vote
JGT
2010
15 years 4 months ago
2010
We investigate the minimization problem of the minimum degree of minimal Ramsey graphs, initiated by Burr, Erd˝os, and Lov´asz. We determine the corresponding graph parameter fo...
161
click to vote
DM
2011
15 years 1 months ago
2011
An acyclic vertex coloring of a graph is a proper vertex coloring such that there are no bichromatic cycles. The acyclic chromatic number of G, denoted ...
158
click to vote
DAM
2010
15 years 6 months ago
2010
A dynamic coloring of a graph is a proper coloring of its vertices such that every vertex of degree more than one has at least two neighbors with distinct colors. The least number...
156
click to vote
COMBINATORICA
2008
15 years 6 months ago
2008
A parity walk in an edge-coloring of a graph is a walk along which each color is used an even number of times. Let p(G) be the least number of colors in an edge-coloring of G havi...
165
click to vote
SIGECOM
2008
ACM
15 years 6 months ago
2008
ACM
Online peer production systems have enabled people to coactively create, share, classify, and rate content on an unprecedented scale. This paper describes strong macroscopic regul...