37 search results - page 8 / 8 » Randomly coloring planar graphs with fewer colors than the m... |
SIAMDM
2010
13 years 1 months ago
2010
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...
FLAIRS
2004
13 years 7 months ago
2004
In the recent years, CSP's have come to be seen as the core problem in many applications. We propose here a hybrid algorithm (MC-FC) that combines two different search method...