2310 search results - page 92 / 462 » Coloring Random Graphs |
DM
2011
13 years 5 months ago
2011
An acyclic vertex coloring of a graph is a proper vertex coloring such that there are no bichromatic cycles. The acyclic chromatic number of G, denoted ...
TCS
2011
13 years 5 months ago
2011
TECS
2010
13 years 4 months ago
2010
CORR
2011
Springer
13 years 2 months ago
2011
Springer
CORR
2008
Springer
13 years 10 months ago
2008
Springer
We present a simple and efficient algorithm for randomly generating simple graphs without small cycles. These graphs can be used to design high performance Low-Density Parity-Chec...