Sciweavers

547 search results - page 46 / 110
» dm 2008
Sort
View
DM
2002
100views more  DM 2002»
15 years 3 months ago
On cop-win graphs
Following a question of Anstee and Farber we investigate the possibility that all bridged graphs are cop-win. We show that in
Gena Hahn, François Laviolette, Norbert Sau...
113
Voted
DM
2002
96views more  DM 2002»
15 years 3 months ago
Chain polynomials and Tutte polynomials
The recently introduced chain and sheaf polynomials of a graph are shown to be essentially equivalent to a weighted version of the Tutte polynomial. c 2002 Elsevier Science B.V. A...
Lorenzo Traldi
DM
2002
93views more  DM 2002»
15 years 3 months ago
New constructions of non-adaptive and error-tolerance pooling designs
We propose two new classes of non-adaptive pooling designs. The first one is guaranteed to be
Hung Q. Ngo, Ding-Zhu Du
112
Voted
DM
1999
69views more  DM 1999»
15 years 3 months ago
Maximal sets of mutually orthogonal Latin squares
Maximal sets of s mutually orthogonal Latin squares of order v are constructed for in
David A. Drake, G. H. John van Rees, W. D. Wallis
DM
2010
103views more  DM 2010»
15 years 2 months ago
The hyperplanes of DQ-(7, k) arising from embedding
We determine all hyperplanes of the dual polar space DQ−(7, K) which arise from embedding. This extends one of the results of [5] to the infinite case.
Bart De Bruyn