720 search results - page 9 / 144 » Nonrepetitive colorings of graphs |
ALGORITHMICA
2002
13 years 7 months ago
2002
A proper coloring of the edges of a graph G is called acyclic if there is no 2-colored cycle in G. The acyclic edge chromatic number of G, denoted by a (G), is the least number of...
STOC
2007
ACM
14 years 7 months ago
2007
ACM
JGT
2010
13 years 6 months ago
2010
We study vertex-colorings of plane graphs that do not contain a rainbow face, i.e., a face with vertices of mutually distinct colors. If G is a 3-connected plane graph with n vert...
WALCOM
2010
IEEE
14 years 2 months ago
2010
IEEE
Given a simple graph G, a harmonious coloring of G is a proper vertex coloring such that each pair of colors appears together on at most one edge. The harmonious chromatic number i...
IJCM
2002
13 years 7 months ago
2002
A radio coloring of a graph G is an assignment of nonnegative integers to its nodes so that each pair of adjacent nodes have color numbers that differ by at least two, and any pai...