On groups of polyhedral graphs. - László Babai; Wilfried Imrich (Discret. Math., 1973)

On the connectivity of cayley graphs. - Wilfried Imrich (J. Comb. Theory B, 1979)

Explicit construction of regular graphs without small cycles. - Wilfried Imrich (Comb., 1984)

On optimal embeddings of metrics in graphs. - Wilfried Imrich; J. M. S. Simões-Pereira; Christina Zamfirescu (J. Comb. Theory B, 1984)

Embedding graphs in Cayley graphs. - Chris D. Godsil; Wilfried Imrich (Graphs Comb., 1987)

A note on the growth of transitive graphs. - Wilfried Imrich; Norbert Seifter (Discret. Math., 1989)

A note on bounded automorphisms of infinite graphs. - Chris D. Godsil; Wilfried Imrich; Norbert Seifter; Mark E. Watkins; Wolfgang Woess (Graphs Comb., 1989)

Factoring Cartesian-Product Graphs at Logarithmic Cost per Edge. - Franz Aurenhammer; Johann Hagauer; Wilfried Imrich (IPCO, 1990)

Focality and graph isomorphism. - Wilfried Imrich; Gert Sabidussi (Discret. Math., 1990)

A survey on graphs with polynomial growth. - Wilfried Imrich; Norbert Seifter (Discret. Math., 1991)

Cartesian Graph Factorization at Logarithmic Cost per Edge. - Franz Aurenhammer; Johann Hagauer; Wilfried Imrich (Comput. Complex., 1992)

Retracts of strong products of graphs. - Wilfried Imrich; Sandi Klavzar (Discret. Math., 1992)

Simple tournaments and sharply transitive groups. - Wilfried Imrich; Jaroslav Nesetril (Discret. Math., 1992)

Separating double rays in locally finite planar graphs. - C. Paul Bonnington; Wilfried Imrich; Mark E. Watkins (Discret. Math., 1995)

Recognizing halved cubes in a constant time per edge. - Wilfried Imrich; Sandi Klavzar; Aleksander Vesel (Eur. J. Comb., 1995)

On the weak reconstruction of Cartesian-product graphs. - Wilfried Imrich; Janez Zerovnik (Discret. Math., 1996)

On the Complexity of Recognizing Hamming Graphs and Related Classes of Graphs. - Wilfried Imrich; Sandi Klavzar (Eur. J. Comb., 1996)

Geodesics in Transitive Graphs. - C. Paul Bonnington; Wilfried Imrich; Norbert Seifter (J. Comb. Theory B, 1996)

Recognizing Cartesian graph bundles. - Wilfried Imrich; Tomaz Pisanski; Janez Zerovnik (Discret. Math., 1997)

Recognizing Hamming Graphs in Linear Time and space. - Wilfried Imrich; Sandi Klavzar (Inf. Process. Lett., 1997)

A characterization of halved cubes. - Wilfried Imrich; Sandi Klavzar; Aleksander Vesel (Ars Comb., 1998)

Factoring cardinal product graphs in polynomial time. - Wilfried Imrich (Discret. Math., 1998)

A Convexity Lemma and Expansion Procedures for Bipartite Graphs. - Wilfried Imrich; Sandi Klavzar (Eur. J. Comb., 1998)

Recognizing Graphs of Acyclic Cubical Complexes. - Wilfried Imrich; Sandi Klavzar (Discret. Appl. Math., 1999)

Median Graphs and Triangle-Free Graphs. - Wilfried Imrich; Sandi Klavzar; Henry Martyn Mulder (SIAM J. Discret. Math., 1999)

Recognizing Median Graphs in Subquadratic Time. - Johann Hagauer; Wilfried Imrich; Sandi Klavzar (Theor. Comput. Sci., 1999)

Weak k-reconstruction of cartesian product graphs. - Wilfried Imrich; Blaz Zniazek; Janez Zerovnik (Electron. Notes Discret. Math., 2001)

On the Strong Product of a k-Extendable and an l-Extendable Graph. - Ervin Györi; Wilfried Imrich (Graphs Comb., 2001)

Minimum cycle bases of product graphs. - Wilfried Imrich; Peter F. Stadler (Australas. J Comb., 2002)

Tiled partial cubes. - Bostjan Bresar; Wilfried Imrich; Sandi Klavzar; Henry Martyn Mulder; Riste Skrekovski (J. Graph Theory, 2002)

Fast recognition algorithms for classes of partial cubes. - Bostjan Bresar; Wilfried Imrich; Sandi Klavzar (Discret. Appl. Math., 2003)

Tree-like isometric subgraphs of hypercubes. - Bostjan Bresar; Wilfried Imrich; Sandi Klavzar (Discuss. Math. Graph Theory, 2003)

Weak k-reconstruction of Cartesian products. - Wilfried Imrich; Blaz Zmazek; Janez Zerovnik (Discuss. Math. Graph Theory, 2003)

A theorem on integer flows on cartesian products of graphs. - Wilfried Imrich; Riste Skrekovski (J. Graph Theory, 2003)

Reconstructing subgraph-counting graph polynomials of increasing families of graphs. - Bostjan Bresar; Wilfried Imrich; Sandi Klavzar (Discret. Math., 2005)

Hypercubes As Direct Products. - Bostjan Bresar; Wilfried Imrich; Sandi Klavzar; Blaz Zmazek (SIAM J. Discret. Math., 2005)

Finite and infinite hypercubes as direct products. - Wilfried Imrich; Douglas F. Rall (Australas. J Comb., 2006)

A prime factor theorem for a generalized direct product. - Wilfried Imrich; Peter F. Stadler (Discuss. Math. Graph Theory, 2006)

Distinguishing Cartesian powers of graphs. - Wilfried Imrich; Sandi Klavzar (J. Graph Theory, 2006)

Distinguishing Infinite Graphs. - Wilfried Imrich; Sandi Klavzar; Vladimir Ivanovich Trofimov (Electron. J. Comb., 2007)

Cancellation properties of products of graphs. - Wilfried Imrich; Sandi Klavzar; Douglas F. Rall (Discret. Appl. Math., 2007)

Fast recognition of classes of almost-median graphs. - Wilfried Imrich; Alenka Lipovec; Iztok Peterin; Petra Zigert (Discret. Math., 2007)

Recognizing Cartesian products in linear time. - Wilfried Imrich; Iztok Peterin (Discret. Math., 2007)

Factoring directed graphs with respect to the cardinal product in polynomial time. - Wilfried Imrich; Werner Klöckl (Discuss. Math. Graph Theory, 2007)

The distinguishing number of Cartesian products of complete graphs. - Wilfried Imrich; Janja Jerebic; Sandi Klavzar (Eur. J. Comb., 2008)

Multiple Kronecker covering graphs. - Wilfried Imrich; Tomaz Pisanski (Eur. J. Comb., 2008)

On Cartesian skeletons of graphs. - Richard H. Hammack; Wilfried Imrich (Ars Math. Contemp., 2009)

On the remoteness function in median graphs. - Kannan Balakrishnan; Bostjan Bresar; Manoj Changat; Wilfried Imrich; Sandi Klavzar; Matjaz Kovse; Ajitha R. Subhamathi (Discret. Appl. Math., 2009)

Approximate graph products. - Marc Hellmuth; Wilfried Imrich; Werner Klöckl; Peter F. Stadler (Eur. J. Comb., 2009)

Lattice embeddings of trees. - Wilfried Imrich; Matjaz Kovse (Eur. J. Comb., 2009)

Transitive, Locally Finite Median Graphs with Finite Blocks. - Wilfried Imrich; Sandi Klavzar (Graphs Comb., 2009)

Local Algorithms for the Prime Factorization of Strong Product Graphs. - Marc Hellmuth; Wilfried Imrich; Werner Klöckl; Peter F. Stadler (Math. Comput. Sci., 2009)

Factoring directed graphs with respect to the cardinal product in polynomial time II. - Wilfried Imrich; Werner Klöckl (Discuss. Math. Graph Theory, 2010)

NZ-flows in strong products of graphs. - Wilfried Imrich; Iztok Peterin; Simon Spacapan; Cun-Quan Zhang (J. Graph Theory, 2010)

Two-ended regular median graphs. - Wilfried Imrich; Sandi Klavzar (Discret. Math., 2011)

Preface. - Pavol Hell; Wilfried Imrich; Jaroslav Nesetril (Discret. Math., 2012)

Partial Star Products: A Local Covering Approach for the Recognition of Approximate Cartesian Product Graphs. - Marc Hellmuth; Wilfried Imrich; Tomas Kupka (Math. Comput. Sci., 2013)

Distinguishing graphs with infinite motion and nonlinear growth. - Johannes Cuno; Wilfried Imrich; Florian Lehner (Ars Math. Contemp., 2014)

Fast recognition of direct and strong products. - Richard H. Hammack; Wilfried Imrich (Ars Math. Contemp., 2014)

Infinite Graphs with Finite 2-Distinguishing Cost. - Debra L. Boutin; Wilfried Imrich (Electron. J. Comb., 2014)

Endomorphism Breaking in Graphs. - Wilfried Imrich; Rafal Kalinowski; Florian Lehner; Monika Pilsniak (Electron. J. Comb., 2014)

Fast recognition of partial star products and quasi cartesian products. - Marc Hellmuth; Wilfried Imrich; Tomas Kupka (Ars Math. Contemp., 2015)

Boxicity and cubicity of product graphs. - L. Sunil Chandran; Wilfried Imrich; Rogers Mathew; Deepak Rajendraprasad (Eur. J. Comb., 2015)

The Cartesian product of graphs with loops. - Tetiana Boiko; Johannes Cuno; Wilfried Imrich; Florian Lehner; Christiaan E. van de Woestijne (Ars Math. Contemp., 2016)

Edge-transitive lexicographic and Cartesian products. - Wilfried Imrich; Ali Iranmanesh; Sandi Klavzar; Abolghasem Soltani (Discuss. Math. Graph Theory, 2016)

Bounds for Distinguishing Invariants of Infinite Graphs. - Wilfried Imrich; Rafal Kalinowski; Monika Pilsniak; Mohammad Hadi Shekarriz (Electron. J. Comb., 2017)

Distinguishing Cartesian products of countable graphs. - Ehsan Estaji; Wilfried Imrich; Rafal Kalinowski; Monika Pilsniak; Thomas W. Tucker (Discuss. Math. Graph Theory, 2017)

Vertex-Transitive Direct Products of Graphs. - Richard H. Hammack; Wilfried Imrich (Electron. J. Comb., 2018)

Cartesian products of directed graphs with loops. - Wilfried Imrich; Iztok Peterin (Discret. Math., 2018)

Direct product of automorphism groups of digraphs. - Mariusz Grech; Wilfried Imrich; Anna Dorota Krystek; Lukasz Jan Wojakowski (Ars Math. Contemp., 2019)

Distinguishing Graphs of Maximum Valence 3. - Svenja Hüning; Wilfried Imrich; Judith Kloas; Hannah Schreiber; Thomas W. Tucker (Electron. J. Comb., 2019)

Asymmetric colorings of products of graphs and digraphs. - Izak Broere; Wilfried Imrich; Rafal Kalinowski; Monika Pilsniak (Discret. Appl. Math., 2019)

The distinguishing index of connected graphs without pendant edges. - Wilfried Imrich; Rafal Kalinowski; Monika Pilsniak; Mariusz Wozniak (Ars Math. Contemp., 2020)

Distinguishing density and the Distinct Spheres Condition. - Wilfried Imrich; Florian Lehner; Simon M. Smith (Eur. J. Comb., 2020)

On Asymmetric Colourings of Claw-Free Graphs. - Wilfried Imrich; Rafal Kalinowski; Monika Pilsniak; Mariusz Wozniak (Electron. J. Comb., 2021)

Regular graphs with minimum spectral gap. - Maryam Abdi; Ebrahim Ghorbani; Wilfried Imrich (Eur. J. Comb., 2021)

Hierarchical product graphs and their prime factorization. - Wilfried Imrich; Rafal Kalinowski; Monika Pilsniak (Art Discret. Appl. Math., 2025)

Local Search Improvements for Soft Happy Colouring. - Mohammad Hadi Shekarriz; Dhananjay R. Thiruvady; Asef Nazari; Wilfried Imrich (CoRR, 2025)