570 search results - page 52 / 114 » Edge Coloring with Delays |
SIBGRAPI
2000
IEEE
15 years 3 months ago
2000
IEEE
Edge detection and image segmentation algorithms usually operate on an image to extract geometrical information based on pixel colors. For ray-traced images, the presence of geomet...
CCCG
2010
15 years 1 months ago
2010
Three types of geometric structure--grid triangulations, rectangular subdivisions, and orthogonal polyhedra-can each be described combinatorially by a regular labeling: an assignm...
EJC
2006
14 years 12 months ago
2006
The problem of counting plane trees with n edges and an even or an odd number of leaves has been recently studied by Eu, Liu and Yeh, in connection with an identity on coloring ne...
JCT
2008
14 years 11 months ago
2008
Let T be an unrooted tree. The chromatic symmetric function XT , introduced by Stanley, is a sum of monomial symmetric functions corresponding to proper colorings of T . The subtre...
136
click to vote
COMBINATORICS
2002
14 years 11 months ago
2002
Erdos, Rubin, and Taylor found a nice correspondence between the minimum order of a complete bipartite graph that is not r-choosable and the minimum number of edges in an r-unifor...