Sciweavers

2283 search results - page 117 / 457
» Bounds of Graph Characteristics
Sort
View
CCCG
2009
13 years 9 months ago
On Graph Thickness, Geometric Thickness, and Separator Theorems
We investigate the relationship between geometric thickness and the thickness, outerthickness, and arboricity of graphs. In particular, we prove that all graphs with arboricity tw...
Christian A. Duncan
COMBINATORICS
2007
100views more  COMBINATORICS 2007»
13 years 8 months ago
Revisiting Two Classical Results on Graph Spectra
Let µ (G) and µmin (G) be the largest and smallest eigenvalues of the adjacency matrix of a graph G. Our main results are: (i) If H is a proper subgraph of a connected graph G o...
Vladimir Nikiforov
CPC
2007
101views more  CPC 2007»
13 years 8 months ago
Colouring Random 4-Regular Graphs
We show that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. The proof uses an efficient algorithm which a.a.s. 3colours a random 4-regular ...
Lingsheng Shi, Nicholas C. Wormald
JCO
2007
56views more  JCO 2007»
13 years 8 months ago
An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure
This paper discusses the relation among four problems: graph testing, DNA complex screening, superimposed codes and secure key distribution. We prove a surprising equivalence relat...
H. B. Chen, Ding-Zhu Du, Frank K. Hwang
COMBINATORICS
2004
108views more  COMBINATORICS 2004»
13 years 8 months ago
On the Chromatic Number of Intersection Graphs of Convex Sets in the Plane
Let G be the intersection graph of a finite family of convex sets obtained by translations of a fixed convex set in the plane. We show that every such graph with clique number k i...
Seog-Jin Kim, Alexandr V. Kostochka, Kittikorn Nak...