570 search results - page 6 / 114 » Edge Coloring with Delays |
DM
1998
14 years 9 months 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...
ICPR
2010
IEEE
14 years 8 months ago
2010
IEEE
—Color models are often used for representing object appearance for foreground segmentation applications. The relationships between colors can be just as useful for object select...
COMBINATORICA
2007
14 years 9 months ago
2007
A colored graph is a complete graph in which a color has been assigned to each edge, and a colorful cycle is a cycle in which each edge has a different color. We first show that ...
ICC
2007
IEEE
15 years 3 months ago
2007
IEEE
— This paper presents a transmission scheduling scheme in sensor networks. Each node is assigned a list of time slots to use for unicast and broadcast communication. The algorith...
68
Voted
JCT
2008
14 years 9 months ago
2008
A proper vertex coloring of a graph is equitable if the sizes of its color classes differ by at most one. In this note, we prove that if G is a graph such that for each edge xy E...