720 search results - page 17 / 144 » Nonrepetitive colorings of graphs |
DSD
2003
IEEE
14 years 24 days ago
2003
IEEE
Heuristic algorithms for coloring the edges of large undirected single-edge graphs with (or very close to) the minimal number of colors are presented. Compared to simulated anneal...
EVOW
2001
Springer
13 years 12 months ago
2001
Springer
This paper presents a new heuristic algorithm for the graph coloring problem based on a combination of genetic algorithms and simulated annealing. Our algorithm exploits a novel cr...
DM
1998
13 years 7 months ago
1998
The total chromatic number zt(G) of a graph G is the least number of colors needed to color the vertices and edges of G so that no adjacent vertices or edges receive the same colo...
COCOA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
HPCC
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than two fro...