Table Of Content

Discrete Mathematics Volume 202, Numbers 1-3, 6 May 1999 Contents Contributions Y. Caro and R. Yuster The uniformity space of hypergraphs and its applications R.S. Coulter and M. Henderson A class of functions and their application in constructing semi-biplanes and association schemes S. Donnelly and G. Isaak Hamiltonian powers in threshold and arborescent comparability graphs R.J. Gardner, P. Gritzmann and D. Prangenberg On the computational complexity of reconstructing lattice sets from their X-rays R. Goldstone The structure of neighbor disconnected vertex transitive graphs K. Heinrich and J. Yin On group divisible covering design A. lorgulescu Connections between MV, algebras and n-valued Lukasiewicz-Moisil algebras — Il P.C.B. Lam, W.C. Shiu and L. Sun On independent domination number of regular graphs LN. Landjev and T. Maruta On the minimum length of quaternary linear codes of dimension five G. Leng and X. Qian Inequalities for any point and two simplices D. Lou On the structure of rninimally n-extendable bipartite graphs J. Mao and D. Li A new upper bound on the number of edges in a geodetic graph D. Peterson and D.R. Woodall Edge-choosability in line-perfect multigraphs M. Plantholt A sublinear bound on the chromatic index of multigraphs M.E. Raines A generalization of the Doyen-Wilson theorem for extended triple systems of all indices G.N. Sarkézy Complete tripartite subgraphs in the coprime graph of integers Discrete Mathematics Volume 202, Numbers 1-3, 6 May 1999 Contents Contributions Y. Caro and R. Yuster The uniformity space of hypergraphs and its applications R.S. Coulter and M. Henderson A class of functions and their application in constructing semi-biplanes and association schemes S. Donnelly and G. Isaak Hamiltonian powers in threshold and arborescent comparability graphs R.J. Gardner, P. Gritzmann and D. Prangenberg On the computational complexity of reconstructing lattice sets from their X-rays R. Goldstone The structure of neighbor disconnected vertex transitive graphs K. Heinrich and J. Yin On group divisible covering design A. lorgulescu Connections between MV, algebras and n-valued Lukasiewicz-Moisil algebras — Il P.C.B. Lam, W.C. Shiu and L. Sun On independent domination number of regular graphs LN. Landjev and T. Maruta On the minimum length of quaternary linear codes of dimension five G. Leng and X. Qian Inequalities for any point and two simplices D. Lou On the structure of rninimally n-extendable bipartite graphs J. Mao and D. Li A new upper bound on the number of edges in a geodetic graph D. Peterson and D.R. Woodall Edge-choosability in line-perfect multigraphs M. Plantholt A sublinear bound on the chromatic index of multigraphs M.E. Raines A generalization of the Doyen-Wilson theorem for extended triple systems of all indices G.N. Sarkézy Complete tripartite subgraphs in the coprime graph of integers V.1. Voloshin and H. Zhou Pseudo-chordal mixed hypergraphs J. Wang and J. Yin Existence of holey 3-GDDs of type (u, g‘w') D.R. Woodall Edge-choosability of multicircuits J.-y. Yao Opacités des automates finis Author index to volume 202