2310 search results - page 92 / 462 » Coloring Random Graphs |
161
click to vote
DM
2011
15 years 1 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 ...
172
click to vote
CORR
2008
Springer
15 years 6 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...