Sciweavers

DM
2011
253views Education» more  DM 2011»
13 years 6 months ago
On the hyperbolicity constant in graphs
If X is a geodesic metric space and x1, x2, x3 ∈ X, a geodesic triangle T = {x1, x2, x3} is the union of the three geodesics [x1x2], [x2x3] and [x3x1] in X. The space X is δ-hy...
José M. Rodríguez, Jose Maria Sigarr...
DM
2011
180views Education» more  DM 2011»
13 years 6 months ago
Large cycles in 4-connected graphs
M. Zh. Nikoghosyan, Zh. G. Nikoghosyan
DM
2011
201views Education» more  DM 2011»
13 years 6 months ago
On permutations avoiding arithmetic progressions
Timothy D. LeSaulnier, Sujith Vijay
DM
2011
207views Education» more  DM 2011»
13 years 6 months ago
Diameter bounds for planar graphs
Radoslav Fulek, Filip Moric, David Pritchard
DM
2011
186views Education» more  DM 2011»
13 years 6 months ago
When linear and weak discrepancy are equal
David M. Howard, Stephen J. Young
DM
2011
178views Education» more  DM 2011»
13 years 6 months ago
Strongly regular graphs with non-trivial automorphisms
Majid Behbahani, Clement W. H. Lam
DM
2011
184views Education» more  DM 2011»
13 years 6 months ago
Graphs of arbitrary excessive class
We show that there exists a family of r-regular graphs of arbitrarily large excessive index for each integer r greater than 3. Furthermore, we answer a question in [1] showing tha...
Giuseppe Mazzuoccolo, M. Young
DM
2011
192views Education» more  DM 2011»
13 years 6 months ago
Coding discretizations of continuous functions
We consider several coding discretizations of continuous functions which reflect their variation at some given precision. We study certain statistical and combinatorial properties...
Cristobal Rojas, Serge Troubetzkoy