Sciweavers

DAM
2007
48views more  DAM 2007»
13 years 11 months ago
The fractional weak discrepancy of a partially ordered set
Alan Shuchat, Randy Shull, Ann N. Trenk
DAM
2007
84views more  DAM 2007»
13 years 11 months ago
Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets
Covering numbers of precompact symmetric convex subsets of Hilbert spaces are investigated. Lower bounds are derived for sets containing orthogonal subsets with norms of their ele...
Vera Kurková, Marcello Sanguineti
DAM
2007
70views more  DAM 2007»
13 years 11 months ago
Path-kipas Ramsey numbers
For two given graphs F and H, the Ramsey number R(F, H) is the smallest positive integer p such that for every graph G on p vertices the following holds: either G contains F as a ...
A. N. M. Salman, H. J. Broersma
DAM
2007
141views more  DAM 2007»
13 years 11 months ago
On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
The packing chromatic number χρ(G) of a graph G is the smallest integer k such that the vertex set of G can be partitioned into packings with pairwise different widths. Several...
Bostjan Bresar, Sandi Klavzar, Douglas F. Rall
DAM
2007
85views more  DAM 2007»
13 years 11 months ago
Further mathematical properties of Cayley digraphs applied to hexagonal and honeycomb meshes
In this paper, we extend known relationships between Cayley digraphs and their subgraphs and coset graphs with respect to subgroups to obtain a number of general results on homomo...
Wenjun Xiao, Behrooz Parhami
DAM
2007
111views more  DAM 2007»
13 years 11 months ago
Vertex-minor reductions can simulate edge contractions
We prove that local complementation and vertex deletion, operations from which vertexminors are defined, can simulate edge contractions. As an application, we prove that the rank...
Mamadou Moustapha Kanté
DAM
2007
94views more  DAM 2007»
13 years 11 months ago
The harmonious coloring problem is NP-complete for interval and permutation graphs
In this paper, we prove that the harmonious coloring problem is NP-complete for connected interval and permutation graphs. Given a simple graph G, a harmonious coloring of G is a ...
Katerina Asdre, Kyriaki Ioannidou, Stavros D. Niko...
DAM
2007
177views more  DAM 2007»
13 years 11 months ago
On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
Michael J. Todd, E. Alper Yildirim
DAM
2007
103views more  DAM 2007»
13 years 11 months ago
The stable fixtures problem - A many-to-many extension of stable roommates
We study a many-to-many generalisation of the well-known stable roommates problem in which each participant seeks to be matched with a number of others. We present a linear-time a...
Robert W. Irving, Sandy Scott