2310 search results - page 38 / 462 » Coloring Random Graphs |
98
Voted
ICIP
1999
IEEE
16 years 3 months ago
1999
IEEE
139
click to vote
CORR
2010
Springer
15 years 2 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...
143
click to vote
SODA
2001
ACM
15 years 3 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...
104
click to vote
CORR
2004
Springer
15 years 2 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...
106
click to vote
COCOON
2007
Springer
15 years 8 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...