836 search results - page 22 / 168 » Orthogonal Colorings of Graphs |
104
click to vote
EVOW
2001
Springer
15 years 4 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
14 years 11 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
15 years 6 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...
DCG
2008
14 years 11 months ago
2008
In this paper we study connections between planar graphs, Schnyder woods, and orthogonal surfaces. Schnyder woods and the face counting approach have important applications in gra...
HPCC
2005
Springer
15 years 5 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...