2310 search results - page 56 / 462 » Coloring Random Graphs |
140
click to vote
FCT
2005
Springer
15 years 11 months ago
2005
Springer
Graph homomorphism, also called H-coloring, is a natural generalization of graph coloring: There is a homomorphism from a graph G to a complete graph on k vertices if and only if ...
130
click to vote
COMBINATORICS
2002
15 years 5 months ago
2002
A sink-free orientation of a finite undirected graph is a choice of orientation
251
click to vote
IWPEC
2010
Springer
15 years 3 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
163
click to vote
WG
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. In random geometric graphs, vertices are randomly distributed on [0, 1]2 and pairs of vertices are connected by edges whenever they are sufficiently close together. Layou...
159
click to vote
DM
2008
15 years 6 months ago
2008
The chromatic capacity cap(G) of a graph G is the largest k for which there exists a k-coloring of the edges of G such that, for every coloring of the vertices of G with the same ...