Wilfried Imrich

85 papers B 1Journal 83Unranked 1
YearRankTypeTitle / Venue / Authors
2026 — conf
Prime Factorization of Hierarchical Products of Infinite Graphs.
CALDAM
Clemens Brand, Wilfried Imrich
2025 J jnl
Hierarchical product graphs and their prime factorization.
Art Discret. Appl. Math.
Wilfried Imrich, Rafal Kalinowski, Monika Pilsniak
2025 J jnl
Local Search Improvements for Soft Happy Colouring.
CoRR
Mohammad Hadi Shekarriz, Dhananjay R. Thiruvady, Asef Nazari, Wilfried Imrich
2025 J jnl
Monoid algebras and graph products.
Art Discret. Appl. Math.
Wilfried Imrich, Igor Klep, Daniel Smertnig
2025 J jnl
On cubic vertex-transitive graphs of given girth.
Art Discret. Appl. Math.
Ted Dobson, Ademir Hujdurovic, Wilfried Imrich, Ronald Ortner
2021 J jnl
On Asymmetric Colourings of Claw-Free Graphs.
Electron. J. Comb.
Wilfried Imrich, Rafal Kalinowski, Monika Pilsniak, Mariusz Wozniak
2021 J jnl
Regular graphs with minimum spectral gap.
Eur. J. Comb.
Maryam Abdi, Ebrahim Ghorbani, Wilfried Imrich
2020 J jnl
Distinguishing density and the Distinct Spheres Condition.
Eur. J. Comb.
Wilfried Imrich, Florian Lehner, Simon M. Smith
2020 J jnl
The distinguishing index of connected graphs without pendant edges.
Ars Math. Contemp.
Wilfried Imrich, Rafal Kalinowski, Monika Pilsniak, Mariusz Wozniak
2019 J jnl
Asymmetric colorings of products of graphs and digraphs.
Discret. Appl. Math.
Izak Broere, Wilfried Imrich, Rafal Kalinowski, Monika Pilsniak
2019 J jnl
Direct product of automorphism groups of digraphs.
Ars Math. Contemp.
Mariusz Grech, Wilfried Imrich, Anna Dorota Krystek, Lukasz Jan Wojakowski
2019 J jnl
Distinguishing Graphs of Maximum Valence 3.
Electron. J. Comb.
Svenja Hüning, Wilfried Imrich, Judith Kloas, Hannah Schreiber, Thomas W. Tucker
2018 J jnl
Cartesian products of directed graphs with loops.
Discret. Math.
Wilfried Imrich, Iztok Peterin
2018 J jnl
Vertex-Transitive Direct Products of Graphs.
Electron. J. Comb.
Richard H. Hammack, Wilfried Imrich
2017 J jnl
Bounds for Distinguishing Invariants of Infinite Graphs.
Electron. J. Comb.
Wilfried Imrich, Rafal Kalinowski, Monika Pilsniak, Mohammad Hadi Shekarriz
2017 J jnl
Distinguishing Cartesian products of countable graphs.
Discuss. Math. Graph Theory
Ehsan Estaji, Wilfried Imrich, Rafal Kalinowski, Monika Pilsniak, Thomas W. Tucker
2017 J jnl
Local algorithms for the prime factorization of strong product graphs.
CoRR
Marc Hellmuth, Wilfried Imrich, Werner Klöckl, Peter F. Stadler
2016 J jnl
Edge-transitive lexicographic and Cartesian products.
Discuss. Math. Graph Theory
Wilfried Imrich, Ali Iranmanesh, Sandi Klavzar, Abolghasem Soltani
2016 J jnl
The Cartesian product of graphs with loops.
Ars Math. Contemp.
Tetiana Boiko, Johannes Cuno, Wilfried Imrich, Florian Lehner, Christiaan E. van de Woestijne
2015 J jnl
Boxicity and cubicity of product graphs.
Eur. J. Comb.
L. Sunil Chandran, Wilfried Imrich, Rogers Mathew, Deepak Rajendraprasad
2015 J jnl
Fast recognition of partial star products and quasi cartesian products.
Ars Math. Contemp.
Marc Hellmuth, Wilfried Imrich, Tomas Kupka
2014 J jnl
Distinguishing graphs with infinite motion and nonlinear growth.
Ars Math. Contemp.
Johannes Cuno, Wilfried Imrich, Florian Lehner
2014 J jnl
Endomorphism Breaking in Graphs.
Electron. J. Comb.
Wilfried Imrich, Rafal Kalinowski, Florian Lehner, Monika Pilsniak
2014 J jnl
Fast recognition of direct and strong products.
Ars Math. Contemp.
Richard H. Hammack, Wilfried Imrich
2014 J jnl
Infinite Graphs with Finite 2-Distinguishing Cost.
Electron. J. Comb.
Debra L. Boutin, Wilfried Imrich
2013 J jnl
Boxicity and Cubicity of Product Graphs
CoRR
L. Sunil Chandran, Wilfried Imrich, Rogers Mathew, Deepak Rajendraprasad
2013 J jnl
Fast Recognition of Partial Star Products and Quasi Cartesian Products.
CoRR
Marc Hellmuth, Wilfried Imrich, Tomas Kupka
2013 J jnl
Partial Star Products: A Local Covering Approach for the Recognition of Approximate Cartesian Product Graphs
CoRR
Marc Hellmuth, Wilfried Imrich, Tomas Kupka
2013 J jnl
Partial Star Products: A Local Covering Approach for the Recognition of Approximate Cartesian Product Graphs.
Math. Comput. Sci.
Marc Hellmuth, Wilfried Imrich, Tomas Kupka
2012 J jnl
Preface.
Discret. Math.
Pavol Hell, Wilfried Imrich, Jaroslav Nesetril
2011 J jnl
Two-ended regular median graphs.
Discret. Math.
Wilfried Imrich, Sandi Klavzar
2010 J jnl
Factoring directed graphs with respect to the cardinal product in polynomial time II.
Discuss. Math. Graph Theory
Wilfried Imrich, Werner Klöckl
2010 J jnl
NZ-flows in strong products of graphs.
J. Graph Theory
Wilfried Imrich, Iztok Peterin, Simon Spacapan, Cun-Quan Zhang
2009 J jnl
Approximate graph products.
Eur. J. Comb.
Marc Hellmuth, Wilfried Imrich, Werner Klöckl, Peter F. Stadler
2009 J jnl
Lattice embeddings of trees.
Eur. J. Comb.
Wilfried Imrich, Matjaz Kovse
2009 J jnl
Local Algorithms for the Prime Factorization of Strong Product Graphs.
Math. Comput. Sci.
Marc Hellmuth, Wilfried Imrich, Werner Klöckl, Peter F. Stadler
2009 J jnl
On Cartesian skeletons of graphs.
Ars Math. Contemp.
Richard H. Hammack, Wilfried Imrich
2009 J jnl
On the remoteness function in median graphs.
Discret. Appl. Math.
Kannan Balakrishnan, Bostjan Bresar, Manoj Changat, Wilfried Imrich, Sandi Klavzar, Matjaz Kovse, Ajitha R. Subhamathi
2009 J jnl
Transitive, Locally Finite Median Graphs with Finite Blocks.
Graphs Comb.
Wilfried Imrich, Sandi Klavzar
2008 J jnl
Multiple Kronecker covering graphs.
Eur. J. Comb.
Wilfried Imrich, Tomaz Pisanski
2008 J jnl
The distinguishing number of Cartesian products of complete graphs.
Eur. J. Comb.
Wilfried Imrich, Janja Jerebic, Sandi Klavzar
2007 J jnl
Cancellation properties of products of graphs.
Discret. Appl. Math.
Wilfried Imrich, Sandi Klavzar, Douglas F. Rall
2007 J jnl
Distinguishing Infinite Graphs.
Electron. J. Comb.
Wilfried Imrich, Sandi Klavzar, Vladimir Ivanovich Trofimov
2007 J jnl
Factoring directed graphs with respect to the cardinal product in polynomial time.
Discuss. Math. Graph Theory
Wilfried Imrich, Werner Klöckl
2007 J jnl
Fast recognition of classes of almost-median graphs.
Discret. Math.
Wilfried Imrich, Alenka Lipovec, Iztok Peterin, Petra Zigert
2007 J jnl
Recognizing Cartesian products in linear time.
Discret. Math.
Wilfried Imrich, Iztok Peterin
2006 J jnl
A prime factor theorem for a generalized direct product.
Discuss. Math. Graph Theory
Wilfried Imrich, Peter F. Stadler
2006 J jnl
Distinguishing Cartesian powers of graphs.
J. Graph Theory
Wilfried Imrich, Sandi Klavzar
2006 J jnl
Finite and infinite hypercubes as direct products.
Australas. J Comb.
Wilfried Imrich, Douglas F. Rall
2005 J jnl
Hypercubes As Direct Products.
SIAM J. Discret. Math.
Bostjan Bresar, Wilfried Imrich, Sandi Klavzar, Blaz Zmazek
2005 J jnl
Reconstructing subgraph-counting graph polynomials of increasing families of graphs.
Discret. Math.
Bostjan Bresar, Wilfried Imrich, Sandi Klavzar
2003 J jnl
A theorem on integer flows on cartesian products of graphs.
J. Graph Theory
Wilfried Imrich, Riste Skrekovski
2003 J jnl
Fast recognition algorithms for classes of partial cubes.
Discret. Appl. Math.
Bostjan Bresar, Wilfried Imrich, Sandi Klavzar
2003 J jnl
Tree-like isometric subgraphs of hypercubes.
Discuss. Math. Graph Theory
Bostjan Bresar, Wilfried Imrich, Sandi Klavzar
2003 J jnl
Weak k-reconstruction of Cartesian products.
Discuss. Math. Graph Theory
Wilfried Imrich, Blaz Zmazek, Janez Zerovnik
2002 J jnl
Minimum cycle bases of product graphs.
Australas. J Comb.
Wilfried Imrich, Peter F. Stadler
2002 J jnl
Tiled partial cubes.
J. Graph Theory
Bostjan Bresar, Wilfried Imrich, Sandi Klavzar, Henry Martyn Mulder, Riste Skrekovski
2001 J jnl
On the Strong Product of a k-Extendable and an l-Extendable Graph.
Graphs Comb.
Ervin Györi, Wilfried Imrich
2001 J jnl
Weak k-reconstruction of cartesian product graphs.
Electron. Notes Discret. Math.
Wilfried Imrich, Blaz Zniazek, Janez Zerovnik
1999 J jnl
Median Graphs and Triangle-Free Graphs.
SIAM J. Discret. Math.
Wilfried Imrich, Sandi Klavzar, Henry Martyn Mulder
1999 J jnl
Recognizing Graphs of Acyclic Cubical Complexes.
Discret. Appl. Math.
Wilfried Imrich, Sandi Klavzar
1999 J jnl
Recognizing Median Graphs in Subquadratic Time.
Theor. Comput. Sci.
Johann Hagauer, Wilfried Imrich, Sandi Klavzar
1998 J jnl
A Convexity Lemma and Expansion Procedures for Bipartite Graphs.
Eur. J. Comb.
Wilfried Imrich, Sandi Klavzar
1998 J jnl
A characterization of halved cubes.
Ars Comb.
Wilfried Imrich, Sandi Klavzar, Aleksander Vesel
1998 J jnl
Factoring cardinal product graphs in polynomial time.
Discret. Math.
Wilfried Imrich
1997 J jnl
Recognizing Cartesian graph bundles.
Discret. Math.
Wilfried Imrich, Tomaz Pisanski, Janez Zerovnik
1997 J jnl
Recognizing Hamming Graphs in Linear Time and space.
Inf. Process. Lett.
Wilfried Imrich, Sandi Klavzar
1996 J jnl
Geodesics in Transitive Graphs.
J. Comb. Theory B
C. Paul Bonnington, Wilfried Imrich, Norbert Seifter
1996 J jnl
On the Complexity of Recognizing Hamming Graphs and Related Classes of Graphs.
Eur. J. Comb.
Wilfried Imrich, Sandi Klavzar
1996 J jnl
On the weak reconstruction of Cartesian-product graphs.
Discret. Math.
Wilfried Imrich, Janez Zerovnik
1995 J jnl
Recognizing halved cubes in a constant time per edge.
Eur. J. Comb.
Wilfried Imrich, Sandi Klavzar, Aleksander Vesel
1995 J jnl
Separating double rays in locally finite planar graphs.
Discret. Math.
C. Paul Bonnington, Wilfried Imrich, Mark E. Watkins
1992 J jnl
Cartesian Graph Factorization at Logarithmic Cost per Edge.
Comput. Complex.
Franz Aurenhammer, Johann Hagauer, Wilfried Imrich
1992 J jnl
Retracts of strong products of graphs.
Discret. Math.
Wilfried Imrich, Sandi Klavzar
1992 J jnl
Simple tournaments and sharply transitive groups.
Discret. Math.
Wilfried Imrich, Jaroslav Nesetril
1991 J jnl
A survey on graphs with polynomial growth.
Discret. Math.
Wilfried Imrich, Norbert Seifter
1990 B conf
Factoring Cartesian-Product Graphs at Logarithmic Cost per Edge.
IPCO
Franz Aurenhammer, Johann Hagauer, Wilfried Imrich
1990 J jnl
Focality and graph isomorphism.
Discret. Math.
Wilfried Imrich, Gert Sabidussi
1989 J jnl
A note on bounded automorphisms of infinite graphs.
Graphs Comb.
Chris D. Godsil, Wilfried Imrich, Norbert Seifter, Mark E. Watkins, Wolfgang Woess
1989 J jnl
A note on the growth of transitive graphs.
Discret. Math.
Wilfried Imrich, Norbert Seifter
1987 J jnl
Embedding graphs in Cayley graphs.
Graphs Comb.
Chris D. Godsil, Wilfried Imrich
1984 J jnl
Explicit construction of regular graphs without small cycles.
Comb.
Wilfried Imrich
1984 J jnl
On optimal embeddings of metrics in graphs.
J. Comb. Theory B
Wilfried Imrich, J. M. S. Simões-Pereira, Christina Zamfirescu
1979 J jnl
On the connectivity of cayley graphs.
J. Comb. Theory B
Wilfried Imrich
1973 J jnl
On groups of polyhedral graphs.
Discret. Math.
László Babai, Wilfried Imrich