Sciweavers

3757 search results - page 144 / 752
» The overlap number of a graph
Sort
View
RSA
2006
81views more  RSA 2006»
15 years 6 months ago
On random points in the unit disk
Let n be a positive integer and > 0 a real number. Let Vn be a set of n points in the unit disk selected uniformly and independently at random. Define G(, n) to be the graph w...
Robert B. Ellis, Xingde Jia, Catherine H. Yan
COMBINATORICA
2007
92views more  COMBINATORICA 2007»
15 years 6 months ago
Codes And Xor Graph Products
What is the maximum possible number, f3(n), of vectors of length n over {0, 1, 2} such that the Hamming distance between every two is even? What is the maximum possible number, g3...
Noga Alon, Eyal Lubetzky
ICALP
2009
Springer
16 years 6 months ago
Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ich...
DM
2008
80views more  DM 2008»
15 years 6 months ago
Restrained bondage in graphs
Let G = (V, E) be a graph. A set S V is a restrained dominating set if every vertex not in S is adjacent to a vertex in S and to a vertex in V - S. The restrained domination numb...
Johannes H. Hattingh, Andrew R. Plummer
COMBINATORICS
2006
97views more  COMBINATORICS 2006»
15 years 6 months ago
H-Free Graphs of Large Minimum Degree
We prove the following extension of an old result of Andr
Noga Alon, Benny Sudakov