4171 search results - page 39 / 835 » Choice numbers of graphs |
207
click to vote
SISAP
2008
IEEE
16 years 1 months ago
2008
IEEE
There are several pieces of information that can be utilized in order to improve the efficiency of similarity searches on high-dimensional data. The most commonly used information...
169
click to vote
JGT
2010
15 years 5 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...
147
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
Given an integer s 0 and a permutation Sn, let ,s be the graph on n vertices {1, . . . , n} where two vertices i < j are adjacent if the permutation flips their order and th...
146
click to vote
ARSCOM
2008
15 years 6 months ago
2008
Let P(n, k) denote the number of graphs on n + k vertices that contain Pn, a path on n vertices, as an induced subgraph. In this note we will find upper and lower bounds for P(n, ...
212
click to vote
LION
2009
Springer
16 years 1 months 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...