836 search results - page 26 / 168 » Orthogonal Colorings of Graphs |
160
click to vote
ENDM
2006
15 years 5 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...
159
click to vote
GC
2002
Springer
15 years 5 months ago
2002
Springer
The main result of the papzer is that any planar graph with odd girth at least 10k
159
click to vote
IJCAI
2001
15 years 7 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...
156
click to vote
APPROX
2006
Springer
15 years 9 months ago
2006
Springer
Consider the following problem: For given graphs G and F1, . . . , Fk, find a coloring of the edges of G with k colors such that G does not contain Fi in color i. For example, if e...
172
click to vote
GD
2001
Springer
15 years 10 months ago
2001
Springer
In this paper, we study 3-dimensional orthogonal graph drawings. Motivated by the fact that only a limited number of layers is possible in VLSI technology, and also noting that a s...