1749 search results - page 24 / 350 » Conditional colorings of graphs |
ESA
2007
Springer
14 years 2 months ago
2007
Springer
Given a graph G = (V, E), a (d, k)-coloring is a function from the vertices V to colors {1, 2, . . . , k} such that any two vertices within distance d of each other are assigned di...
CCCG
2009
13 years 9 months ago
2009
A set of n points in the plane is a universal pointset for a given class of graphs, if any n-vertex graph in that class can be embedded in the plane so that vertices are mapped to...
ESA
2008
Springer
13 years 10 months ago
2008
Springer
We consider two generalizations of the edge coloring problem in bipartite graphs. The first problem we consider is the weighted bipartite edge coloring problem where we are given a...
TCS
2010
13 years 6 months ago
2010
— Rahman and Kaykobad introduced a shortest distance based condition for finding the existence of Hamiltonian paths in graphs as follows: Let G be a connected graph with n vertic...
PICS
2000
13 years 9 months ago
2000
Color appearance models provide a powerful tool for achieving a viewing condition independent color representation. However, current color appearance models such as CIECAM97s 1,2 ...