default search action
Discrete Mathematics, Volume 237
Volume 237, Number 1-3, June 2001
- Gill Barequet:
A duality between small-face problems in arrangements of lines and Heilbronn-type problems. 1-12 - Bostjan Bresar:
Partial Hamming graphs and expansion procedures. 13-27 - Shiow-Yun Chang, Donna Crystal Llewellyn, John H. Vande Vate:
Matching 2-lattice polyhedra: finding a maximum vector. 29-61 - Shiow-Yun Chang, Donna Crystal Llewellyn, John H. Vande Vate:
Two-lattice polyhedra: duality and extreme points. 63-95 - Charles J. Colbourn, Feliu Sagols:
Triangulations and a generalization of Bose's method. 97-107 - Dean Crnkovic
, Mario-Osvin Pavcevic
Some new symmetric designs with parameters (64, 28, 12). 109-118 - Charles Delorme, Oscar Ordaz, Domingo Quiroz
Some remarks on Davenport constant. 119-128 - Zoltán Füredi, André Kündgen
Covering a graph with cuts of minimum total size. 129-148 - Terry Gannon:
The cyclic structure of unimodal permutations. 149-161 - Xiang-dong Hou:
The eigenmatrix of the linear association scheme on R(2, m). 163-184 - Yeow Meng Chee
An improved finiteness theorem for graphical t-designs. 185-186 - Andrei Kotlov:
Tree width and regular triangulations. 187-191 - Chunxiang Wang, Jingzhong Mao:
Some more remarks on domination in cubic graphs. 193-197
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-03-05 20:56 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: