3204 search results - page 11 / 641 » The Alcuin Number of a Graph |
173
click to vote
DAM
1999
15 years 5 months ago
1999
The achromatic number (G) of a graph G = (V, E) is the maximum k such that V has a partition V1, V2, . . . , Vk into independent sets, the union of no pair of which is independent...
159
click to vote
JGT
2010
15 years 4 months ago
2010
The crossing number, cr(G), of a graph G is the least number of crossing points in any drawing of G in the plane. According to the Crossing Lemma of Ajtai, Chv´atal, Newborn, Sze...
202
click to vote
LION
2009
Springer
16 years 15 days ago
2009
Springer
This work introduces new bounds on the clique number of graphs derived from a result due to S´os and Straus, which generalizes the Motzkin-Straus Theorem to a specific class of h...
159
click to vote
ENDM
2002
15 years 5 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...
135
click to vote
WG
2010
Springer
15 years 4 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...