Wilfried Imrich

Q: What Schools Are Affiliated With Wilfried Imrich

Wilfried Imrich is affiliated with the following schools: University of Leoben, TU Wien, University of Klagenfurt, University at Albany, SUNY, Graz University of Technology, University of Vienna

Wilfried Imrich's AcademicInfluence.com Rankings

Wilfried Imrich

Mathematics

#3849

World Rank

#5585

Historical Rank

Graph Theory

#49

World Rank

#56

Historical Rank

Combinatorics

#103

World Rank

#111

Historical Rank

Measure Theory

#3343

World Rank

#3947

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Wilfried Imrich's Degrees

PhD Mathematics Graz University of Technology

Why Is Wilfried Imrich Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Wilfried Imrich is an Austrian mathematician working mainly in graph theory. He is known for his work on graph products, and authored the books Product Graphs: Structure and Recognition , Topics in graph theory: Graphs and their Cartesian Products , and Handbook of Product Graphs .

(See a Problem?)

Wilfried Imrich's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Product Graphs: Structure and Recognition (2000) (907)
Handbook of Product Graphs, Second Edition (2011) (410)
Topics in Graph Theory: Graphs and Their Cartesian Product (2008) (177)
Distinguishing Cartesian powers of graphs (2006) (85)
Distinguishing Infinite Graphs (2007) (75)
Recognizing Cartesian products in linear time (2007) (67)
Median Graphs and Triangle-Free Graphs (1999) (59)
The distinguishing number of Cartesian products of complete graphs (2008) (59)
Associative products of graphs (1975) (57)
Explicit construction of regular graphs without small cycles (1984) (53)
Factoring cardinal product graphs in polynomial time (1998) (50)
Subgroup theorems and graphs (1977) (50)
A Convexity Lemma and Expansion Procedures for Bipartite Graphs (1998) (50)
Cartesian graph factorization at logarithmic cost per edge (1992) (45)
On optimal embeddings of metrics in graphs (1984) (44)
Hypercubes As Direct Products (2005) (42)
Factoring Cartesian-product graphs (1994) (37)
On automorphism groups of Cayley graphs (1976) (35)
On the connectivity of cayley graphs (1979) (34)
On graphical regular representations of cyclic extensions of groups (1974) (33)
A survey on graphs with polynomial growth (1991) (31)
Multiple Kronecker covering graphs (2005) (29)
On finitely generated subgroups of free groups (1977) (28)
Tournaments with given regular group (1978) (27)
Recognizing Median Graphs in Subquadratic Time (1999) (26)
Embedding Graphs into Cartesian Products (1989) (25)
A note on bounded automorphisms of infinite graphs (1989) (25)
A note on the growth of transitive graphs (1989) (24)
Infinite motion and 2-distinguishability of graphs and groups (2013) (24)
A theorem on integer flows on cartesian products of graphs (2003) (24)
On Cartesian skeletons of graphs (2009) (22)
Transitive planar graphs (1979) (22)
Approximate graph products (2009) (22)
Tiled partial cubes (2002) (20)
Separating double rays in locally finite planar graphs (1995) (19)
Minimum cycle bases of product graphs (2001) (19)
Graphen mit transitiver Automorphismengruppe (1969) (18)
Distinguishing Cartesian Products of Countable Graphs (2017) (16)
Local Algorithms for the Prime Factorization of Strong Product Graphs (2009) (16)
A bound for groups of linear growth (1987) (16)
Tree-like isometric subgraphs of hypercubes (2003) (16)
On the Complexity of Recognizing Hamming Graphs and Related Classes of Graphs (1996) (15)
Partial Star Products: A Local Covering Approach for the Recognition of Approximate Cartesian Product Graphs (2013) (15)
On graphs with regular groups (1975) (14)
Distinguishing graphs with infinite motion and nonlinear growth (2013) (14)
Endomorphism Breaking in Graphs (2013) (13)
Fast recognition algorithms for classes of partial cubes (2003) (13)
Periodic Points of Continuous Mappings of Trees (1985) (12)
On the weak reconstruction of Cartesian-product graphs (1996) (12)
On the remoteness function in median graphs (2009) (11)
Characterization of Trivalent Graphs with Minimal Eigenvalue Gap (2007) (11)
On products of graphs and regular groups (1972) (11)
Distinguishing Graphs of Maximum Valence 3 (2017) (11)
Retracts of strong products of graphs (1992) (11)
On the number of subgroups of given index in the modular group (1979) (10)
A simple O ( mn ) algorithm for recognizing Hamming graphs (2010) (10)
On groups of polyhedral graphs (1973) (10)
On the number of subgroups of given index inSL2(Z) (1978) (10)
Embedding graphs in Cayley graphs (1987) (9)
A prime factor theorem for a generalized direct product (2006) (9)
Periodic Points of small Periods of Continuous Mappings of Trees (1985) (9)
Trees and Length Functions on Groups (1983) (9)
Recognizing Hamming Graphs in Linear Time and space (1997) (9)
Bounds for Distinguishing Invariants of Infinite Graphs (2017) (8)
Boxicity and cubicity of product graphs (2013) (8)
The Cost of Distinguishing Graphs (2017) (7)
On the Strong Product of a k-Extendable and an l-Extendable Graph (2001) (7)
Direct product of automorphism groups of digraphs (2019) (7)
Finite and infinite hypercubes as direct products (2006) (7)
Cancellation properties of products of graphs (2007) (7)
Remarks on the Intersection of Finitely Generated Subgroups of a Free Group (1986) (7)
The distinguishing index of connected graphs without pendant edges (2020) (7)
Recognizing Graphs of Acyclic Cubical Complexes (1999) (6)
On the maximal distance of spanning trees (1968) (6)
Transitive, Locally Finite Median Graphs with Finite Blocks (2009) (6)
Reconstructing subgraph-counting graph polynomials of increasing families of graphs (2005) (6)
Fixed subsets of homomorphisms of free groups (1990) (6)
Sense preserving groups of polyhedral graphs (1975) (6)
Weak k-reconstruction of cartesian product graphs (2001) (6)
NZ‐flows in strong products of graphs (2010) (6)
Recognizing Cartesian graph bundles (1997) (5)
Factoring Cartesian-Product Graphs at Logarithmic Cost per Edge (1990) (5)
Two-ended regular median graphs (2011) (5)
Fast Recognition of Partial Star Products and Quasi Cartesian Products (2013) (5)
Factoring directed graphs with respect to the cardinal product in polynomial time II (2010) (5)
Infinite Graphs with Finite 2-Distinguishing Cost (2014) (5)
Geodesics in Transitive Graphs (1996) (5)
On Howson's Theorem (1994) (5)
Fast recognition of direct and strong products (2014) (5)
On the Rank of Fixed Point Sets of Automorphisms of Free Groups (1990) (4)
Vertex-Transitive Direct Products of Graphs (2018) (4)
Lattice embeddings of trees (2009) (4)
Cartesian products of directed graphs with loops (2017) (4)
NZ-flows in strong products of graphs (2010) (4)
A characterization of halved cubes (1998) (4)
CONSTRUCTION OF REGULAR GRAPHS WITHOUT SMALL CYCLES (1984) (4)
Fast recognition of classes of almost-median graphs (2007) (4)
Algebraic graph theory - a volume dedicated to Gert Sabidussi on the occasion of his 80th birthday (2012) (4)
Weak k-reconstruction of Cartesian products (2003) (3)
Distinguishing innite graphs (2007) (3)
On the lexicographic and costrong product of set systems (1971) (3)
RELATIONS BETWEEN MEDIAN GRAPHS , SEMI-MEDIAN GRAPHS AND PARTIAL (1998) (3)
Simple tournaments and sharply transitive groups (1992) (3)
Recognizing halved cubes in a constant time per edge (1995) (3)
The Average Size of Nonsingular Sets in a Graph (1993) (3)
Factoring directed graphs with respect to the cardinal product in polynomial time (2007) (3)
Edge-transitive products (2016) (3)
The Cartesian product of graphs with loops (2014) (2)
Recognizing generalized Sierpiński graphs (2020) (2)
Edge-Transitive Lexicographic and Cartesian Products (2016) (2)
Distinguishing density and the Distinct Spheres Condition (2018) (2)
Classification of tensor products of symmetric graphs (1991) (2)
Asymmetrizing trees of maximum valence 2ℵ0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2^{\aleph _0}$$\end{document (2020) (2)
Abelian groups with identical relations (1967) (1)
Erratum to: Infinite motion and 2-distinguishability of graphs and groups (2015) (1)
On Automorphisms of Graphs with Forbidden Subgraphs (1984) (1)
Asymmetrizing cost and density of vertex-transitive cubic graphs (2022) (1)
On a theorem of Halin (2015) (1)
On Asymmetric Colourings of Claw-Free Graphs (2021) (1)
Distinguishing locally finite trees (2018) (1)
Asymmetrizing infinite trees (2023) (0)
1902 DISTINGUISHING CARTESIAN PRODUCTS OF COUNTABLE GRAPHS (2016) (0)
Tournaments with given regular groups (1978) (0)
Infinite motion and 2-distinguishability of graphs and groups (2014) (0)
Book review (1987) (0)
Erratum to: Infinite motion and 2-distinguishability of graphs and groups (2014) (0)
Asymmetrizing trees of maximum valence $$2^{\aleph _0}$$ (2020) (0)
Edge-transitive products (2015) (0)
C O ] 8 J ul 2 01 9 Regular Graphs with Minimum Spectral Gap (2019) (0)
Grushko's theorem (1984) (0)
On a theorem of Halin (2016) (0)
Focality and graph isomorphism (1990) (0)
Partial Star Products: A Local Covering Approach for the Recognition of Approximate Cartesian Product Graphs (2013) (0)
Asymmetric colorings of products of graphs and digraphs (2019) (0)
Preface (2012) (0)

This paper list is powered by the following services:

Other Resources About Wilfried Imrich

en.wikipedia.org

What Schools Are Affiliated With Wilfried Imrich?

Wilfried Imrich is affiliated with the following schools:

Wilfried Imrich's Academic­Influence.com Rankings

Wilfried Imrich's Degrees

Why Is Wilfried Imrich Influential?

Wilfried Imrich's Published Works

Published Works

Other Resources About Wilfried Imrich

What Schools Are Affiliated With Wilfried Imrich?

Wilfried Imrich's AcademicInfluence.com Rankings