Discrete Mathematics, Volume 109

Volume 109, Numbers 1-3, November 1992

• Preface. 1
  Electronic Edition (link) BibTeX
• Franz Aurenhammer, Johann Hagauer:
  Computing equivalence classes among the edges of a graph with applications. 3-12
  Electronic Edition (link) BibTeX
• Hans-Jürgen Bandelt, Henry Martyn Mulder:
  Pseudo-median graphs are join spaces. 13-26
  Electronic Edition (link) BibTeX
• Jørgen Bang-Jensen, Pavol Hell, Gary MacGillivray:
  On the complexity of colouring by superdigraphs of bipartite graphs. 27-44
  Electronic Edition (link) BibTeX
• Michael Böttcher, Ulrich Knauer:
  Endomorphism spectra of graphs. 45-57
  Electronic Edition (link) BibTeX
• Pramod K. Das, Alexander Rosa:
  Halving Steiner triple systems. 59-67
  Electronic Edition (link) BibTeX
• Carl Droms, Brigitte Servatius, Herman Servatius:
  Groups assembled from free and direct products. 69-75
  Electronic Edition (link) BibTeX
• Joan Feigenbaum, Alejandro A. Schäffer:
  Finding the prime factors of strong direct product graphs in polynomial time. 77-102
  Electronic Edition (link) BibTeX
• Herbert Fleischner, Gert Sabidussi, Emanuel Wenger:
  Transforming eulerian trails. 103-116
  Electronic Edition (link) BibTeX
• Pavol Hell, Jaroslav Nesetril:
  The core of a graph. 117-126
  Electronic Edition (link) BibTeX
• Bernhard Hochstrasser:
  A note on Winkler's algorithm for factoring a connected graph. 127-132
  Electronic Edition (link) BibTeX
• Walter Holberg:
  The decomposition of graphs into k-connected components. 133-145
  Electronic Edition (link) BibTeX
• Wilfried Imrich, Sandi Klavzar:
  Retracts of strong products of graphs. 147-154
  Electronic Edition (link) BibTeX
• Sandi Klavzar:
  Two remarks on retracts of graph products. 155-160
  Electronic Edition (link) BibTeX
• Dragan Marusic, Raffaele Scapellato:
  A class of non-Cayley vertex- transitive graphs associated with PSL(2, p). 161-170
  Electronic Edition (link) BibTeX
• Bojan Mohar:
  Laplace eigenvalues of graphs - a survey. 171-183
  Electronic Edition (link) BibTeX
• James G. Oxley, Dominic J. A. Welsh:
  Tutte polynomials computable in polynomial time. 185-192
  Electronic Edition (link) BibTeX
• Massimo A. Picardello, Mitchell H. Taibleson, Wolfgang Woess:
  Harmonic measure of the planar Cantor set from the viewpoint of graph theory. 193-202
  Electronic Edition (link) BibTeX
• Tomaz Pisanski:
  Orientable quadrilateral embeddings of products of graphs. 203-205
  Electronic Edition (link) BibTeX
• Michael D. Plummer:
  Extending matchings in planar graphs IV. 207-219
  Electronic Edition (link) BibTeX
• Norbert Polat:
  Similarity and asymmetrization of trees. 221-238
  Electronic Edition (link) BibTeX
• Ales Pultr:
  On Sabidussi-Fawcett subdirect representation. 239-253
  Electronic Edition (link) BibTeX
• Ivan Rival, Jorge Urrutia:
  Representing orders by moving figures in space. 255-263
  Electronic Edition (link) BibTeX
• Martin Skoviera, Jozef Sirán:
  Regular maps from Cayley graphs, part 1: Balanced Cayley maps. 265-276
  Electronic Edition (link) BibTeX
• Jonathan D. H. Smith:
  Quasigroups and quandles. 277-282
  Electronic Edition (link) BibTeX
• Claude Tardif:
  Prefibers and the cartesian product of metric spaces. 283-288
  Electronic Edition (link) BibTeX
• Mark E. Watkins:
  Some conditions for 1-transitivity. 289-296
  Electronic Edition (link) BibTeX
• Paul M. Weichsel:
  Distance regular subgraphs of a cube. 297-306
  Electronic Edition (link) BibTeX
• Joseph Zaks:
  Uniform distances in rational unit-distance graphs. 307-311
  Electronic Edition (link) BibTeX