7 citations · 14 across the 15 of their papers we have counts for
6 papers · 1 filter
Endomorphism Breaking in Graphs
Wilfried Imrich, Rafał Kalinowski, Florian Lehner +1
We introduce the {\it endomorphism distinguishing number} of a graph as the least cardinal such that has a vertex coloring with colors that is only preserv…
Distinguishing graphs with infinite motion and nonlinear growth
Johannes Cuno, Wilfried Imrich, Florian Lehner
The distinguishing number of a graph is the least cardinal such that has a labeling with labels which is only preserved by the trivial automorp…
Fast Recognition of Partial Star Products and Quasi Cartesian Products
Marc Hellmuth, Wilfried Imrich, Tomas Kupka
This paper is concerned with the fast computation of a relation on the edge set of connected graphs that plays a decisive role in the recognition of approximate Cartesian prod…
Boxicity and Cubicity of Product Graphs
L. Sunil Chandran, Wilfried Imrich, Rogers Mathew +1
The 'boxicity' ('cubicity') of a graph G is the minimum natural number k such that G can be represented as an intersection graph of axis-parallel rectangular boxes (axis-parallel u…
Infinite Motion and 2-Distinguishability of Graphs and Groups
Wilfried Imrich, Simon M. Smith, Thomas W. Tucker +1
A group A acting faithfully on a set X is 2-distinguishable if there is a 2-coloring of X that is not preserved by any nonidentity element of A, equivalently, if there is a proper…
Partial Star Products: A Local Covering Approach for the Recognition of Approximate Cartesian Product Graphs
Marc Hellmuth, Wilfried Imrich, Tomas Kupka
This paper is concerned with the recognition of approximate graph products with respect to the Cartesian product. Most graphs are prime, although they can have a rich product-like…