Wilfried Imrich

Publication Activity (10 Years)

Years Active: 1973-2021
Publications (10 Years): 14

Top Topics

Graph Theoretic

Correct Recognition

Cartesian Product

Top Venues

Electron. J. Comb.

Ars Math. Contemp.

Publications

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