4171 search results - page 40 / 835 » Choice numbers of graphs |
ESA
2008
Springer
15 years 1 months ago
2008
Springer
We consider a planning problem that generalizes Alcuin's river crossing problem (also known as: The wolf, goat, and cabbage puzzle) to scenarios with arbitrary conflict graph...
EJC
2008
14 years 12 months ago
2008
Let D be a set of positive integers. The distance graph generated by D, denoted by G(Z, D), has the set Z of all integers as the vertex Supported in part by the National Science ...
ENDM
2002
14 years 11 months ago
2002
Let G = (V, E) be a simple graph on vertex set V and define a function f : V {-1, 1}. The function f is a signed dominating function if for every vertex x V, the closed neighbor...
WG
2010
Springer
14 years 10 months ago
2010
Springer
We prove that for sufficiently large n, there exist unit disk graphs on n vertices such that for every representation with disks in the plane at least c √ n bits are needed to wr...
JGT
2007
14 years 11 months ago
2007
: Let G be a graph on n vertices in which every induced subgraph on s = log3 n vertices has an independent set of size at least t = log n. What is the largest q = q(n) so that ever...