


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

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.