Wilfried Imrich

2008
34	EE	Wilfried Imrich, Janja Jerebic, Sandi Klavzar: The distinguishing number of Cartesian products of complete graphs. Eur. J. Comb. 29(4): 922-929 (2008)
33	EE	Wilfried Imrich, Tomaz Pisanski: Multiple Kronecker covering graphs. Eur. J. Comb. 29(5): 1116-1122 (2008)
2007
32	EE	Wilfried Imrich, Sandi Klavzar, Douglas F. Rall: Cancellation properties of products of graphs. Discrete Applied Mathematics 155(17): 2362-2364 (2007)
31	EE	Wilfried Imrich, Alenka Lipovec, Iztok Peterin, Petra Zigert: Fast recognition of classes of almost-median graphs. Discrete Mathematics 307(3-5): 464-471 (2007)
30	EE	Wilfried Imrich, Iztok Peterin: Recognizing Cartesian products in linear time. Discrete Mathematics 307(3-5): 472-483 (2007)
29	EE	Wilfried Imrich, Sandi Klavzar, Vladimir Ivanovich Trofimov: Distinguishing Infinite Graphs. Electr. J. Comb. 14(1): (2007)
2006
28	EE	Wilfried Imrich, Sandi Klavzar: Distinguishing Cartesian powers of graphs. Journal of Graph Theory 53(3): 250-260 (2006)
2005
27	EE	Bostjan Bresar, Wilfried Imrich, Sandi Klavzar: Reconstructing subgraph-counting graph polynomials of increasing families of graphs. Discrete Mathematics 297(1-3): 159-166 (2005)
26	EE	Bostjan Bresar, Wilfried Imrich, Sandi Klavzar, Blaz Zmazek: Hypercubes As Direct Products. SIAM J. Discrete Math. 18(4): 778-786 (2005)
2003
25	EE	Bostjan Bresar, Wilfried Imrich, Sandi Klavzar: Fast recognition algorithms for classes of partial cubes. Discrete Applied Mathematics 131(1): 51-61 (2003)
2001
24	EE	Wilfried Imrich, Blaz Zniazek, Janez Zerovnik: Weak k-reconstruction of cartesian product graphs. Electronic Notes in Discrete Mathematics 10: 297-300 (2001)
23	EE	Ervin Györi, Wilfried Imrich: On the Strong Product of a k-Extendable and an l-Extendable Graph. Graphs and Combinatorics 17(2): 245-253 (2001)
1999
22	EE	Wilfried Imrich, Sandi Klavzar: Recognizing Graphs of Acyclic Cubical Complexes. Discrete Applied Mathematics 95(1-3): 321-330 (1999)
21	EE	Wilfried Imrich, Sandi Klavzar, Henry Martyn Mulder: Median Graphs and Triangle-Free Graphs. SIAM J. Discrete Math. 12(1): 111-118 (1999)
20	EE	Johann Hagauer, Wilfried Imrich, Sandi Klavzar: Recognizing Median Graphs in Subquadratic Time. Theor. Comput. Sci. 215(1-2): 123-136 (1999)
1998
19		Wilfried Imrich, Sandi Klavzar, Aleksander Vesel: A characterization of halved cubes. Ars Comb. 48: (1998)
18	EE	Wilfried Imrich: Factoring cardinal product graphs in polynomial time. Discrete Mathematics 192(1-3): 119-144 (1998)
17	EE	Wilfried Imrich, Sandi Klavzar: A Convexity Lemma and Expansion Procedures for Bipartite Graphs. Eur. J. Comb. 19(6): 677-685 (1998)
1997
16	EE	Wilfried Imrich, Tomaz Pisanski, Janez Zerovnik: Recognizing Cartesian graph bundles. Discrete Mathematics 167-168: 393-403 (1997)
15	EE	Wilfried Imrich, Sandi Klavzar: Recognizing Hamming Graphs in Linear Time and space. Inf. Process. Lett. 63(2): 91-95 (1997)
1996
14	EE	Wilfried Imrich, Janez Zerovnik: On the weak reconstruction of Cartesian-product graphs. Discrete Mathematics 150(1-3): 167-178 (1996)
13	EE	Wilfried Imrich, Sandi Klavzar: On the Complexity of Recognizing Hamming Graphs and Related Classes of Graphs. Eur. J. Comb. 17(2-3): 209-221 (1996)
12	EE	C. Paul Bonnington, Wilfried Imrich, Norbert Seifter: Geodesics in Transitive Graphs. J. Comb. Theory, Ser. B 67(1): 12-33 (1996)
1995
11	EE	C. Paul Bonnington, Wilfried Imrich, Mark E. Watkins: Separating double rays in locally finite planar graphs. Discrete Mathematics 145(1-3): 61-72 (1995)
1992
10		Franz Aurenhammer, Johann Hagauer, Wilfried Imrich: Cartesian Graph Factorization at Logarithmic Cost per Edge. Computational Complexity 2: 331-349 (1992)
9	EE	Wilfried Imrich, Jaroslav Nesetril: Simple tournaments and sharply transitive groups. Discrete Mathematics 108(1-3): 159-165 (1992)
8	EE	Wilfried Imrich, Sandi Klavzar: Retracts of strong products of graphs. Discrete Mathematics 109(1-3): 147-154 (1992)
1991
7	EE	Wilfried Imrich, Norbert Seifter: A survey on graphs with polynomial growth. Discrete Mathematics 95(1-3): 101-117 (1991)
1990
6		Franz Aurenhammer, Johann Hagauer, Wilfried Imrich: Factoring Cartesian-Product Graphs at Logarithmic Cost per Edge. IPCO 1990: 29-44
5	EE	Wilfried Imrich, Gert Sabidussi: Focality and graph isomorphism. Discrete Mathematics 81(3): 237-245 (1990)
1989
4	EE	Wilfried Imrich, Norbert Seifter: A note on the growth of transitive graphs. Discrete Mathematics 73(1-2): 111-117 (1989)
1984
3		Wilfried Imrich: Explicit construction of regular graphs without small cycles. Combinatorica 4(1): 53-59 (1984)
2	EE	Wilfried Imrich, J. M. S. Simões-Pereira, Christina Zamfirescu: On optimal embeddings of metrics in graphs. J. Comb. Theory, Ser. B 36(1): 1-15 (1984)
1979
1	EE	Wilfried Imrich: On the connectivity of cayley graphs. J. Comb. Theory, Ser. B 26(3): 323-326 (1979)

Coauthor Index

1	Franz Aurenhammer	[6] [10]
2	C. Paul Bonnington	[11] [12]
3	Bostjan Bresar	[25] [26] [27]
4	Ervin Györi	[23]
5	Johann Hagauer	[6] [10] [20]
6	Janja Jerebic	[34]
7	Sandi Klavzar	[8] [13] [15] [17] [19] [20] [21] [22] [25] [26] [27] [28] [29] [32] [34]
8	Alenka Lipovec	[31]
9	Henry Martyn Mulder	[21]
10	Jaroslav Nesetril (Jarik Nesetril)	[9]
11	Iztok Peterin	[30] [31]
12	Tomaz Pisanski	[16] [33]
13	Douglas F. Rall	[32]
14	Gert Sabidussi	[5]
15	Norbert Seifter	[4] [7] [12]
16	J. M. S. Simões-Pereira	[2]
17	Vladimir Ivanovich Trofimov	[29]
18	Aleksander Vesel	[19]
19	Mark E. Watkins	[11]
20	Christina Zamfirescu	[2]
21	Janez Zerovnik	[14] [16] [24]
22	Petra Zigert	[31]
23	Blaz Zmazek	[26]
24	Blaz Zniazek	[24]

Colors in the list of coauthors