European Journal of Combinatorics

Preface
pp. i-i(1)
Authors: Deuber W.; Deza M.

Combinatorial Techniques and Objects in Computer Science: Fault-tolerance and Other Interesting Applications
pp. 97-111(15)
Authors: Singhi N.M.; Shriniwas I.; Antony T.A.

Graphs of Acyclic Cubical Complexes
pp. 113-120(8)
Authors: Bandelt H.J.; Chepoi V.

Cellular Bipartite Graphs
pp. 121-134(14)
Authors: Bandelt H.J.; Chepoi V.

Metric and Topological Aspects of the Symmetric Group of Countable Degree
pp. 135-142(8)
Author: Cameron P.J.

Cut Lattices and Equiangular Lines
pp. 143-156(14)
Authors: Deza M.; Grishukhin V.P.

A Note on l 1 -rigid Planar Graphs
pp. 157-160(4)
Authors: Deza M.; Tuma J.

T-theory: An Overview
pp. 161-175(15)
Authors: Dress A.; Moulton V.; Terhalle W.

A Combinatorial Construction For Twin Trees
pp. 177-189(13)
Author: Fon-Der-Flaass D.G.

Tree-Tree Matrices and Other Combinatorial Problems from Taxonomy
pp. 191-208(18)
Author: Hazewinkel M.

On the Complexity of Recognizing Hamming Graphs and Related Classes of Graphs
pp. 209-221(13)
Authors: Imrich W.; Klavzar S.

Minimum (2, r)-Metrics and Integer Multiflows
pp. 223-232(10)
Authors: Karzanov A.V.; Manoussakis Y.G.

Gap Inequalities for the Cut Polytope
pp. 233-254(22)
Authors: Laurent M.; Poljak S.

Minimum Spanning Trees and Types of Dissimilarities
pp. 255-264(10)
Author: Leclerc B.

Upper Bounds on the Covering Radius of a Code with a Given Dual Distance
pp. 265-270(6)
Authors: Litsyn S.; Tietavainen A.

On √ Q-Distances
pp. 271-277(7)
Author: Maehara H.

Recognition of the l 1 -Graphs with Complexity O(nm), or Football in a Hypercube
pp. 279-289(11)
Authors: Deza M.; Shpectorov S.

Ubiquity in Category for Metric Spaces and Transition Systems
pp. 291-307(17)
Authors: Pouzet M.; Roux B.

Consequences of the Brylawski-Lucas Theorem for Binary Matroids
pp. 309-316(8)
Author: Wild M.

Representation of Ordinal Contexts by Ordered n-Quasigroups
pp. 317-333(17)
Author: Wille U.