836 search results - page 26 / 168 » Orthogonal Colorings of Graphs |
ENDM
2006
14 years 11 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...
GC
2002
Springer
14 years 11 months ago
2002
Springer
The main result of the papzer is that any planar graph with odd girth at least 10k
IJCAI
2001
15 years 1 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...
APPROX
2006
Springer
15 years 3 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...
105
click to vote
GD
2001
Springer
15 years 4 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...