765 search results - page 19 / 153 » Graph Coloring with Rejection |
DM
2002
13 years 8 months ago
2002
In 1993, Brualdi and Massey conjectured that every graph can be incidence colored with + 2 colors, where is the maximum degree of a graph. Although this conjecture was solved in ...
ISTCS
1993
Springer
14 years 21 days ago
1993
Springer
This thesis introduces a model of a random walk on a colored undirected graph. Such a graph has a single vertex set and distinct sets of edges, each of which has a color. A par...
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...