Volume 202, Numbers 1-3, May 1999
- Yair Caro, Raphael Yuster:
The uniformity space of hypergraphs and its applications.
1-19
- Robert S. Coulter, Marie Henderson:
A class of functions and their application in constructing semi-biplanes and association schemes.
21-31
- Sam Donnelly, Garth Isaak:
Hamiltonian powers in threshold and arborescent comparability graphs.
33-44
- Richard J. Gardner, Peter Gritzmann, D. Prangenberg:
On the computational complexity of reconstructing lattice sets from their X-rays.
45-71
- Richard Goldstone:
The structure of neighbor disconnected vertex transitive graphs.
73-100
- Katherine Heinrich, Jianxing Yin:
On group divisible covering designs.
101-112
- Afrodita Iorgulescu:
Connections between MVn algebras and n-valued Lukasiewicz-Moisil algebras - II.
113-134
- Peter Che Bor Lam, Wai Chee Shiu, Liang Sun:
On independent domination number of regular graphs.
135-144
- Ivan N. Landjev, Tatsuya Maruta:
On the minimum length of quaternary linear codes of dimension five.
145-161
- Gangsong Leng, Xiangzheng Qian:
Inequalities for any point and two simplices.
163-172
- Dingjun Lou:
On the structure of minimally n-extendable bipartite graphs.
173-181
- Jingzhong Mao, Deying Li:
A new upper bound on the number of edges in a geodetic graph.
183-189
- Dale Peterson, Douglas R. Woodall:
Edge-choosability in line-perfect multigraphs.
191-199
- Michael Plantholt:
A sublinear bound on the chromatic index of multigraphs.
201-213
- Michael Edwin Raines:
A generalization of the Doyen-Wilson theorem for extended triple systems of all indices.
215-225
- Gábor N. Sárközy:
Complete tripartite subgraphs in the coprime graph of integers.
227-238
- Vitaly I. Voloshin, Huishan Zhou:
Pseudo-chordal mixed hypergraphs.
239-248
- J. Wang, J. Yin:
Existence of holey 3-GDDs of type (u, gtw1).
249-269
- Douglas R. Woodall:
Edge-choosability of multicircuits.
271-277
- Jia-Yan Yao:
Opacités des automates finis.
279-298
Last update Thu May 23 18:41:25 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
