Discrete Mathematics, Volume 58

Volume 58, Number 1, January 1986

• Denise Amar:
  Partition of a bipartite hamiltonian graph into two cycles. 1-10
  
• Didier Arquès:
  Les hypercartes planaires sont des arbres tres bien etiquetes. 11-24
  
• Michael Hager:
  On score sets for tournaments. 25-34
  
• Antonín Leanovsky, Vlastimil Pták:
  A measure of thickness for families of sets. 35-44
  
• Antonio Pasini:
  On certain geometries of type C_n and F₄. 45-61
  
• Anthony J. W. Hilton, Christopher A. Rodger:
  Hamiltonian decompositions of complete regular s-partite graphs. 63-78
  
• Bojan Mohar:
  On the cycle space of graphs. 79-80
  
• Ulrich Betke, Peter Gritzmann:
  An application of valuation theory to two problems in discrete geometry. 81-85
  
• C. R. J. Clapham:
  Universal tilings and universal (0, 1)-matrices. 87-92
  
• Yoshimi Egawa, Masatsugu Urabe, Toshihito Fukuda, Seiichiro Nagoya:
  A decomposition of complete bipartite graphs into edge-disjoint subgraphs with star components. 93-95
  
• Nathan Linial:
  Graph coloring and monotone functions on posets. 97-98
  
• Svatopluk Poljak, Daniel Turzík:
  A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound. 99-104
  
• Dominique Sotteau, A. Pawel Wojda:
  Digraphs without directed path of length two or three. 105-108
  
• M. Werman, Doron Zeilberger:
  A bijective proof of Cassini's Fibonacci identity. 109
  

Volume 58, Number 2, February 1986

• Abdelhamid Benhocine:
  Pancyclism and Meyniel's conditions. 113-120
  
• Michele Conforti, Derek G. Corneil, Ali Ridha Mahjoub:
  K_i-covers I: Complexity and polytopes. 121-142
  
• John Ginsburg:
  Extensions of ordered sets having the finite cutset property. 143-157
  
• Keh Ying Lin:
  Magic cubes and hypercubes of order 3. 159-166
  
• Giovanni Lo Faro:
  Steiner quadruple systems having a prescribed number of quadruples in common. 167-174
  
• Paul Terwilliger:
  The Johnson graph J(d, r) is unique if (d, r) != (2, 8). 175-189
  
• Noga Alon:
  Explicit construction of exponential sized families of k-independent sets. 191-193
  
• Judit Csima:
  Generalized Hilton construction for embedding d-ary quasigroups. 195-197
  
• Dieter Jungnickel, Gerhard Grams:
  Maximal difference matrices of order <=10. 199-203
  
• Johannes A. La Poutré:
  A theorem on associative block designs. 205-208
  
• Andrew D. Pollington:
  On the density of B₂-bases. 209-211
  

Volume 58, Number 3, March 1986

• I. Borosh, M. Flahive, B. Treybig:
  Small solutions of linear Diophantine equations. 215-220
  
• Ernest J. Cockayne, B. Gamble, F. Bruce Shepherd:
  Domination parameters for the bishops graph. 221-227
  
• David A. Drake:
  Embedding maximal cliques of sets in maximal cliques of bigger sets. 229-242
  
• Odile Favaron, Oscar Ordaz:
  A sufficient condition for oriented graphs to be Hamiltonian. 243-252
  
• Henry A. Kierstead, James H. Schmerl:
  The chromatic number of graphs which induce neither K_{1, 3} nor K₅-e. 253-262
  
• Seiya Negami, Guang-Han Xu:
  Locally geodesic cycles in 2-self-centered graphs. 263-268
  
• Miroslav Petrovic:
  Finite type graphs and some graph operations, II. 269-274
  
• Cees Roos, A. J. van Zanten:
  On the existence of certain generalized Moore geometries, part III. 275-283
  
• Pablo M. Salzberg, Miguel A. López, Reinaldo E. Giudici:
  On the chromatic uniquenes of bipartite graphs. 285-294
  
• Ulrich Faigle, Rainer Schrader:
  A combinatorial bijection between linear extensions of equivalent orders. 295-301
  
• R. Aravamudhan, B. Rajendran:
  A note on 'on antipodal graphs'. 303-305
  
• Yoshimi Egawa:
  Characterization of the cartesian product of complete graphs by convex subgraphs. 307-309
  
• Hiroshi Maehara:
  On the sphericity of the graphs of semiregular polyhedra. 311-315
  
• Norbert Seifter:
  A note on infinite transitive graphs. 317-321
  

Last update Sat May 18 20:21:31 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page