Discrete Mathematics, Volume 161

Volume 161, Numbers 1-3, December 1996

• Jørgen Bang-Jensen, Gregory Gutin, Jing Huang:
  A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian. 1-12
  
• Arrigo Bonisoli, Gábor Korchmáros:
  Suzuki groups, one-factorizations and Lüneburg planes. 13-24
  
• André Bouchet, Laurence Ghier:
  Connectivity and beta-invariants of isotropic systems and 4-regular graphs. 25-44
  
• Luis Boza, Ana Diánez, Alberto Márquez:
  The center of an infinite graph. 45-52
  
• Rainer E. Burkard, Tibor Dudás, Thomas Maier:
  Cut and patch Steiner trees for ladders. 53-61
  
• Michael B. Dillencourt, Warren D. Smith:
  Graph-theoretical conditions for inscribability and Delaunay realizability. 63-77
  
• David Dorrough:
  Convergence of sequences of iterated triangular line graphs. 79-86
  
• Alexandru Filipoiu, George Georgescu:
  On values in relatively normal lattices. 87-100
  
• Markus Fulmek, Christian Krattenthaler:
  A bijection between Proctor's and Sundaram's odd orthogonal tableaux. 101-120
  
• Wayne Goddard, Henda C. Swart:
  Distances between graphs under edge operations. 121-132
  
• Jaroslaw Grytczuk:
  Infinite self-similar words. 133-141
  
• Johann Hagauer, Sandi Klavzar:
  Clique-gated graphs. 143-149
  
• T. E. Hall, Mark V. Sapir:
  Idempotents, regular elements and sequences from finite semigroups. 151-160
  
• Michael A. Henning, Ortrud R. Oellermann, Henda C. Swart:
  The diversity of domination. 161-173
  
• Michael A. Henning, Ortrud R. Oellermann, Henda C. Swart:
  Local edge domination critical graphs. 175-184
  
• Jianping Li, Feng Tian:
  A proof of a conjecture about D_lambda-paths in graphs with large neighborhood unions. 185-196
  
• Daphne Der-Fen Liu:
  T-graphs and the channel assignment problem. 197-205
  
• Oscar Ordaz, Denise Amar, André Raspaud:
  Hamiltonian properties and the bipartite independence number. 207-215
  
• Themistocles Politof, A. Satyanarayana:
  The structure of quasi 4-connected graphs. 217-228
  
• Shijun Ren:
  A sufficient condition for graphs with large neighborhood unions to be traceable. 229-234
  
• E. Sampathkumar, L. Pushpa Latha:
  Strong weak domination and domination balance in a graph. 235-242
  
• Ramesh S. Sankaranarayana, Lorna K. Stewart:
  Recursively decomposable well-covered graphs. 243-263
  
• R. I. Tyshkevich, Vadim E. Zverovich:
  Line hypergraphs. 265-283
  
• S. Arumugam, K. A. Germina:
  On indexable graphs. 285-289
  
• Marco Buratti:
  Edge-colourings characterizing a class of Cayley graphs and a new characterization of hypercubes. 291-295
  
• Martin Kochol:
  A cyclically 6-edge-connected snark of order 118. 297-300
  
• Alexander Y. Kreinin, Alek Vainshtein:
  Asymptotics for Morgan numbers of fractional orders. 301-308
  
• Dayanand S. Rajan, Anil M. Shende:
  A characterization of root lattices. 309-314
  
• Eckhard Steffen:
  Counterexamples to a conjecture about bottlenecks in non-Tait-colourable cubic graphs. 315
  
• Gh. Toader:
  On Chebyshev's inequality for sequences. 317-322
  
• Hong Zhang:
  Characterization of self-complementary symmetric digraphs. 323-327