1749 search results - page 26 / 350 » Conditional colorings of graphs |
GC
2002
Springer
13 years 8 months ago
2002
Springer
The main result of the papzer is that any planar graph with odd girth at least 10k
IJCAI
2001
13 years 10 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
14 years 7 days 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...
JGT
2008
13 years 8 months ago
2008
Given a fixed multigraph H with V (H) = {h1, . . . , hm}, we say that a graph G is H-linked if for every choice of m vertices v1, . . . , vm in G, there exists a subdivision of H i...
SIAMDM
2008
13 years 8 months ago
2008
We consider the class of graphs that contain no bull, no odd hole, and no antihole of length at least five. We present a new algorithm that colors optimally the vertices of every g...