836 search results - page 24 / 168 » Orthogonal Colorings of Graphs |
107
click to vote
DAM
2006
15 years 1 months ago
2006
In the precoloring extension problem we are given a graph with some of the vertices having a preassigned color and it has to be decided whether this coloring can be extended to a ...
116
Voted
DAM
2010
15 years 1 months ago
2010
In the minimum sum edge coloring problem, we aim to assign natural numbers to edges of a graph, so that adjacent edges receive different numbers, and the sum of the numbers assign...
112
click to vote
DM
2002
15 years 1 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 ...
113
click to vote
ISTCS
1993
Springer
15 years 5 months 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...
102
click to vote
ESA
2007
Springer
15 years 8 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...