Wilfried Imrich

Orcid: 0000-0002-0475-9335

According to our database1, Wilfried Imrich authored at least 76 papers between 1973 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Regular graphs with minimum spectral gap.
Eur. J. Comb., 2021

On Asymmetric Colourings of Claw-Free Graphs.
Electron. J. Comb., 2021

2020
Distinguishing density and the Distinct Spheres Condition.
Eur. J. Comb., 2020

The distinguishing index of connected graphs without pendant edges.
Ars Math. Contemp., 2020

2019
Asymmetric colorings of products of graphs and digraphs.
Discret. Appl. Math., 2019

Distinguishing Graphs of Maximum Valence 3.
Electron. J. Comb., 2019

Direct product of automorphism groups of digraphs.
Ars Math. Contemp., 2019

2018
Cartesian products of directed graphs with loops.
Discret. Math., 2018

Vertex-Transitive Direct Products of Graphs.
Electron. J. Comb., 2018

2017
Distinguishing Cartesian products of countable graphs.
Discuss. Math. Graph Theory, 2017

Bounds for Distinguishing Invariants of Infinite Graphs.
Electron. J. Comb., 2017

2016
Edge-transitive lexicographic and Cartesian products.
Discuss. Math. Graph Theory, 2016

The Cartesian product of graphs with loops.
Ars Math. Contemp., 2016

2015
Boxicity and cubicity of product graphs.
Eur. J. Comb., 2015

Fast recognition of partial star products and quasi cartesian products.
Ars Math. Contemp., 2015

2014
Endomorphism Breaking in Graphs.
Electron. J. Comb., 2014

Infinite Graphs with Finite 2-Distinguishing Cost.
Electron. J. Comb., 2014

Fast recognition of direct and strong products.
Ars Math. Contemp., 2014

Distinguishing graphs with infinite motion and nonlinear growth.
Ars Math. Contemp., 2014

2013
Partial Star Products: A Local Covering Approach for the Recognition of Approximate Cartesian Product Graphs.
Math. Comput. Sci., 2013

2012
Preface.
Discret. Math., 2012

2011
Two-ended regular median graphs.
Discret. Math., 2011

2010
NZ-flows in strong products of graphs.
J. Graph Theory, 2010

Factoring directed graphs with respect to the cardinal product in polynomial time II.
Discuss. Math. Graph Theory, 2010

2009
Local Algorithms for the Prime Factorization of Strong Product Graphs.
Math. Comput. Sci., 2009

Transitive, Locally Finite Median Graphs with Finite Blocks.
Graphs Comb., 2009

Lattice embeddings of trees.
Eur. J. Comb., 2009

Approximate graph products.
Eur. J. Comb., 2009

On the remoteness function in median graphs.
Discret. Appl. Math., 2009

On Cartesian skeletons of graphs.
Ars Math. Contemp., 2009

2008
Multiple Kronecker covering graphs.
Eur. J. Comb., 2008

The distinguishing number of Cartesian products of complete graphs.
Eur. J. Comb., 2008

2007
Factoring directed graphs with respect to the cardinal product in polynomial time.
Discuss. Math. Graph Theory, 2007

Recognizing Cartesian products in linear time.
Discret. Math., 2007

Fast recognition of classes of almost-median graphs.
Discret. Math., 2007

Cancellation properties of products of graphs.
Discret. Appl. Math., 2007

Distinguishing Infinite Graphs.
Electron. J. Comb., 2007

2006
Distinguishing Cartesian powers of graphs.
J. Graph Theory, 2006

A prime factor theorem for a generalized direct product.
Discuss. Math. Graph Theory, 2006

Finite and infinite hypercubes as direct products.
Australas. J Comb., 2006

2005
Hypercubes As Direct Products.
SIAM J. Discret. Math., 2005

Reconstructing subgraph-counting graph polynomials of increasing families of graphs.
Discret. Math., 2005

2003
A theorem on integer flows on cartesian products of graphs.
J. Graph Theory, 2003

Weak k-reconstruction of Cartesian products.
Discuss. Math. Graph Theory, 2003

Tree-like isometric subgraphs of hypercubes.
Discuss. Math. Graph Theory, 2003

Fast recognition algorithms for classes of partial cubes.
Discret. Appl. Math., 2003

2002
Tiled partial cubes.
J. Graph Theory, 2002

Minimum cycle bases of product graphs.
Australas. J Comb., 2002

2001
On the Strong Product of a k-Extendable and an l-Extendable Graph.
Graphs Comb., 2001

Weak k-reconstruction of cartesian product graphs.
Electron. Notes Discret. Math., 2001

1999
Recognizing Median Graphs in Subquadratic Time.
Theor. Comput. Sci., 1999

Median Graphs and Triangle-Free Graphs.
SIAM J. Discret. Math., 1999

Recognizing Graphs of Acyclic Cubical Complexes.
Discret. Appl. Math., 1999

1998
A Convexity Lemma and Expansion Procedures for Bipartite Graphs.
Eur. J. Comb., 1998

Factoring cardinal product graphs in polynomial time.
Discret. Math., 1998

A characterization of halved cubes.
Ars Comb., 1998

1997
Recognizing Hamming Graphs in Linear Time and space.
Inf. Process. Lett., 1997

Recognizing Cartesian graph bundles.
Discret. Math., 1997

1996
Geodesics in Transitive Graphs.
J. Comb. Theory B, 1996

On the Complexity of Recognizing Hamming Graphs and Related Classes of Graphs.
Eur. J. Comb., 1996

On the weak reconstruction of Cartesian-product graphs.
Discret. Math., 1996

1995
Recognizing halved cubes in a constant time per edge.
Eur. J. Comb., 1995

Separating double rays in locally finite planar graphs.
Discret. Math., 1995

1992
Simple tournaments and sharply transitive groups.
Discret. Math., 1992

Retracts of strong products of graphs.
Discret. Math., 1992

Cartesian Graph Factorization at Logarithmic Cost per Edge.
Comput. Complex., 1992

1991
A survey on graphs with polynomial growth.
Discret. Math., 1991

1990
Focality and graph isomorphism.
Discret. Math., 1990

Factoring Cartesian-Product Graphs at Logarithmic Cost per Edge.
Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990

1989
A note on bounded automorphisms of infinite graphs.
Graphs Comb., 1989

A note on the growth of transitive graphs.
Discret. Math., 1989

1987
Embedding graphs in Cayley graphs.
Graphs Comb., 1987

1984
On optimal embeddings of metrics in graphs.
J. Comb. Theory B, 1984

Explicit construction of regular graphs without small cycles.
Comb., 1984

1979
On the connectivity of cayley graphs.
J. Comb. Theory B, 1979

1973
On groups of polyhedral graphs.
Discret. Math., 1973


  Loading...