2310 search results - page 38 / 462 » Coloring Random Graphs |
ICIP
1999
IEEE
14 years 10 months ago
1999
IEEE
CORR
2010
Springer
13 years 9 months ago
2010
Springer
The oriented chromatic number of an oriented graph G is the minimum order of an oriented graph H such that G admits a homomorphism to H. The oriented chromatic number of an undire...
SODA
2001
ACM
13 years 10 months ago
2001
ACM
Many massive graphs (such as the WWW graph and Call graphs) share certain universal characteristics which can be described by so-called the "power law". Here we determin...
CORR
2004
Springer
13 years 8 months ago
2004
Springer
A Meyniel graph is a graph in which every odd cycle of length at least five has two chords. We present a linear-time algorithm that colors optimally the vertices of a Meyniel grap...
COCOON
2007
Springer
14 years 3 months ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...