Table Of Content

ALGEBRAIC GRAPH THEORY A VOLUME DEDICATED TO GERT SABIDUSSI Guest Editors: P. Hell W. Imrich CONTENTS Preface F. Aurenhaandm Jm. Heagraue r Computing equivalence classes among the edges of a graph with applications H.-J. Bandelt and H.M. Mulder Pseudog-rapmhs earde jioina snpac es J. Bang-Jensen, P. Hell and G. MacGillivray On the complexity of colouring by superdigraphs of bipartite graphs M. Bédtatndc Uh. eKnarue r Endomorspepctrha iofs grmap hs P.K. Das and A. Rosa C. Droms, B. Servatianuds H . Servatius Groups assembied from free and direct products J. Feigeannd bA.Aa. uSchmaff er Finding the prime factors of strong direct product graphs in polynomial time B. Hochstrasser A note on Winkier’s algorithm for factoring a connected graph W. Hohberg The decomposition of graphs into k-connected components W. imrich and S. Klavzar Retracts of strong products of graphs S. Klavzar Two remarks on retracts of graph products ALGEBRAIC GRAPH THEORY A VOLUME DEDICATED TO GERT SABIDUSSI Guest Editors: P. Hell W. Imrich CONTENTS Preface F. Aurenhaandm Jm. Heagraue r Computing equivalence classes among the edges of a graph with applications H.-J. Bandelt and H.M. Mulder Pseudog-rapmhs earde jioina snpac es J. Bang-Jensen, P. Hell and G. MacGillivray On the complexity of colouring by superdigraphs of bipartite graphs M. Bédtatndc Uh. eKnarue r Endomorspepctrha iofs grmap hs P.K. Das and A. Rosa C. Droms, B. Servatianuds H . Servatius Groups assembied from free and direct products J. Feigeannd bA.Aa. uSchmaff er Finding the prime factors of strong direct product graphs in polynomial time B. Hochstrasser A note on Winkier’s algorithm for factoring a connected graph W. Hohberg The decomposition of graphs into k-connected components W. imrich and S. Klavzar Retracts of strong products of graphs S. Klavzar Two remarks on retracts of graph products D. Maranud Rs. Sicapéella to A class of non-Cayley vertex-transitive graphs associated with PSL(2, p) B. Mohar Laplace eigenovf garaplhsu—a esusrv ey J.G. Oxlaned Dy.J. A. Welsh Tutte polynomials computabie in polynomial time M.A. Picardello, M.H. Taiblesoann d W. Woess Harmonic measure of the planar Cantor set from the viewpoint of graph theory T Pi i Orientable quadrilateral embeddings of products of graphs M.D. Plummer Extending matchings in planar graphs IV N. Polat Similarity and atten aft A. Pultr On Sabidussisub—diFrecat wrecpreesenttattio n |. Rival and J. Urrutia Reproerderss bey monvingt fiigurens ign sp ace M. Skovainde Jr. Sair ah Regular maps from Cayley graphs, Part 1: Balanced Cayley maps J.D.H. Smith Quasigroups and quandies C. Tardif Prefibers and the cartesian product of metric spaces M.E. Watkins Some conditions for 1-transitivity P.M. Weichsel Distance regular subgraphs of a cube J. Zaks Uniform distances in rational unit-distagnracpehs Author index to volume 109