Journals in DBLP

Eur. J. Comb.
1996, volume: 17, number: 2-3

1. N. M. Singhi, Iyengar Shriniwas, T. A. Antony
   Combinatorial Techniques and Objects in Computer Science: Fault-tolerance and Other Interesting Applications. [Citation Graph (0, 0)][DBLP]
   Eur. J. Comb., 1996, v:17, n:2-3, pp:97-111 [Journal]
   
2. Hans-Jürgen Bandelt, Victor Chepoi
   Graphs of Acyclic Cubical Complexes. [Citation Graph (0, 0)][DBLP]
   Eur. J. Comb., 1996, v:17, n:2-3, pp:113-120 [Journal]
   
3. Hans-Jürgen Bandelt, Victor Chepoi
   Cellular Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
   Eur. J. Comb., 1996, v:17, n:2-3, pp:121-134 [Journal]
   
4. Peter J. Cameron
   Metric and Topological Aspects of the Symmetric Group of Countable Degree. [Citation Graph (0, 0)][DBLP]
   Eur. J. Comb., 1996, v:17, n:2-3, pp:135-142 [Journal]
   
5. Michel Deza, Viatcheslav P. Grishukhin
   Cut Lattices and Equiangular Lines. [Citation Graph (0, 0)][DBLP]
   Eur. J. Comb., 1996, v:17, n:2-3, pp:143-156 [Journal]
   
6. Michel Deza, Jirí Tuma
   A Note on l₁-rigid Planar Graphs. [Citation Graph (0, 0)][DBLP]
   Eur. J. Comb., 1996, v:17, n:2-3, pp:157-160 [Journal]
   
7. Andreas W. M. Dress, Vincent Moulton, Werner F. Terhalle
   T-theory: An Overview. [Citation Graph (0, 0)][DBLP]
   Eur. J. Comb., 1996, v:17, n:2-3, pp:161-175 [Journal]
   
8. Dmitry Fon-Der-Flaass
   A Combinatorial Construction For Twin Trees. [Citation Graph (0, 0)][DBLP]
   Eur. J. Comb., 1996, v:17, n:2-3, pp:177-189 [Journal]
   
9. Michiel Hazewinkel
   Tree-Tree Matrices and Other Combinatorial Problems from Taxonomy. [Citation Graph (0, 0)][DBLP]
   Eur. J. Comb., 1996, v:17, n:2-3, pp:191-208 [Journal]
   
10. Wilfried Imrich, Sandi Klavzar
    On the Complexity of Recognizing Hamming Graphs and Related Classes of Graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1996, v:17, n:2-3, pp:209-221 [Journal]
    
11. Alexander V. Karzanov, Yannis Manoussakis
    Minimum (2, r)-Metrics and Integer Multiflows. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1996, v:17, n:2-3, pp:223-232 [Journal]
    
12. Monique Laurent, Svatopluk Poljak
    Gap Inequalities for the Cut Polytope. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1996, v:17, n:2-3, pp:233-254 [Journal]
    
13. Bruno Leclerc
    Minimum Spanning Trees and Types of Dissimilarities. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1996, v:17, n:2-3, pp:255-264 [Journal]
    
14. Simon Litsyn, Aimo Tietäväinen
    Upper Bounds on the Covering Radius of a Code with a Given Dual Distance. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1996, v:17, n:2-3, pp:265-270 [Journal]
    
15. Hiroshi Maehara
    On sqrt(Q)-Distances. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1996, v:17, n:2-3, pp:271-277 [Journal]
    
16. Michel Deza, Sergey V. Shpectorov
    Recognition of thel₁-Graphs with ComplexityO(nm), orFootball in a Hypercube. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1996, v:17, n:2-3, pp:279-289 [Journal]
    
17. Maurice Pouzet, Bernard Roux
    Ubiquity in Category for Metric Spaces and Transition Systems. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1996, v:17, n:2-3, pp:291-307 [Journal]
    
18. Marcel Wild
    Consequences of the Brylawski-Lucas Theorem for Binary Matroids. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1996, v:17, n:2-3, pp:309-316 [Journal]
    
19. Uta Wille
    Representation of Ordinal Contexts by Ordered n-Quasigroups. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1996, v:17, n:2-3, pp:317-333 [Journal]