2310 search results - page 33 / 462 » Coloring Random Graphs |
114
click to vote
ENDM
2006
15 years 2 months ago
2006
Many classes of graphs where the vertex coloring problem is polynomially solvable are known, the most prominent being the class of perfect graphs. However, the list-coloring proble...
111
click to vote
RSA
2010
15 years 16 days ago
2010
We analyze the convergence of the spectrum of large random graphs to the spectrum of a limit infinite graph. We apply these results to graphs converging locally to trees and deri...
112
click to vote
GC
2002
Springer
15 years 1 months ago
2002
Springer
The main result of the papzer is that any planar graph with odd girth at least 10k
115
Voted
IJCAI
2001
15 years 3 months ago
2001
We give a graph theoretical characterization of answer sets of normal logic programs. We show that there is a one-to-one correspondence between answer sets and a special, non-stan...
111
click to vote
SIAMDM
2008
15 years 2 months ago
2008
We consider the class of graphs that contain no bull, no odd hole, and no antihole of length at least five. We present a new algorithm that colors optimally the vertices of every g...