Wilfried Imrich

	2012
47		Pavol Hell, Wilfried Imrich, Jaroslav Nesetril: Preface. Discrete Mathematics 312(1): 1 (2012)
	2011
46		Wilfried Imrich, Sandi Klavzar: Two-ended regular median graphs. Discrete Mathematics 311(15): 1418-1422 (2011)
	2010
45		Wilfried Imrich, Werner Klöckl: Factoring directed graphs with respect to the cardinal product in polynomial time II. Discussiones Mathematicae Graph Theory 30(3): 461-474 (2010)
44		Wilfried Imrich, Iztok Peterin, Simon Spacapan, Cun-Quan Zhang: NZ-flows in strong products of graphs. Journal of Graph Theory 64(4): 267-276 (2010)
	2009
43		Kannan Balakrishnan, Bostjan Bresar, Manoj Changat, Wilfried Imrich, Sandi Klavzar, Matjaz Kovse, Ajitha R. Subhamathi: On the remoteness function in median graphs. Discrete Applied Mathematics 157(18): 3679-3688 (2009)
42		Marc Hellmuth, Wilfried Imrich, Werner Klöckl, Peter F. Stadler: Approximate graph products. Eur. J. Comb. 30(5): 1119-1133 (2009)
41		Wilfried Imrich, Matjaz Kovse: Lattice embeddings of trees. Eur. J. Comb. 30(5): 1142-1148 (2009)
40		Wilfried Imrich, Sandi Klavzar: Transitive, Locally Finite Median Graphs with Finite Blocks. Graphs and Combinatorics 25(1): 81-90 (2009)
39		Marc Hellmuth, Wilfried Imrich, Werner Klöckl, Peter F. Stadler: Local Algorithms for the Prime Factorization of Strong Product Graphs. Mathematics in Computer Science 2(4): 653-682 (2009)
	2008
38		Wilfried Imrich, Janja Jerebic, Sandi Klavzar: The distinguishing number of Cartesian products of complete graphs. Eur. J. Comb. 29(4): 922-929 (2008)
37		Wilfried Imrich, Tomaz Pisanski: Multiple Kronecker covering graphs. Eur. J. Comb. 29(5): 1116-1122 (2008)
	2007
36		Wilfried Imrich, Sandi Klavzar, Douglas F. Rall: Cancellation properties of products of graphs. Discrete Applied Mathematics 155(17): 2362-2364 (2007)
35		Wilfried Imrich, Alenka Lipovec, Iztok Peterin, Petra Zigert: Fast recognition of classes of almost-median graphs. Discrete Mathematics 307(3-5): 464-471 (2007)
34		Wilfried Imrich, Iztok Peterin: Recognizing Cartesian products in linear time. Discrete Mathematics 307(3-5): 472-483 (2007)
33		Wilfried Imrich, Werner Klöckl: Factoring directed graphs with respect to the cardinal product in polynomial time. Discussiones Mathematicae Graph Theory 27(3): 593-601 (2007)
32		Wilfried Imrich, Sandi Klavzar, Vladimir Ivanovich Trofimov: Distinguishing Infinite Graphs. Electr. J. Comb. 14(1): (2007)
	2006
31		Wilfried Imrich, Peter F. Stadler: A prime factor theorem for a generalized direct product. Discussiones Mathematicae Graph Theory 26(1): 135-140 (2006)
30		Wilfried Imrich, Sandi Klavzar: Distinguishing Cartesian powers of graphs. Journal of Graph Theory 53(3): 250-260 (2006)
	2005
29		Bostjan Bresar, Wilfried Imrich, Sandi Klavzar: Reconstructing subgraph-counting graph polynomials of increasing families of graphs. Discrete Mathematics 297(1-3): 159-166 (2005)
28		Bostjan Bresar, Wilfried Imrich, Sandi Klavzar, Blaz Zmazek: Hypercubes As Direct Products. SIAM J. Discrete Math. 18(4): 778-786 (2005)
	2003
27		Bostjan Bresar, Wilfried Imrich, Sandi Klavzar: Fast recognition algorithms for classes of partial cubes. Discrete Applied Mathematics 131(1): 51-61 (2003)
	2001
26		Wilfried Imrich, Blaz Zniazek, Janez Zerovnik: Weak k-reconstruction of cartesian product graphs. Electronic Notes in Discrete Mathematics 10: 297-300 (2001)
25		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
24		Wilfried Imrich, Sandi Klavzar: Recognizing Graphs of Acyclic Cubical Complexes. Discrete Applied Mathematics 95(1-3): 321-330 (1999)
23		Wilfried Imrich, Sandi Klavzar, Henry Martyn Mulder: Median Graphs and Triangle-Free Graphs. SIAM J. Discrete Math. 12(1): 111-118 (1999)
22		Johann Hagauer, Wilfried Imrich, Sandi Klavzar: Recognizing Median Graphs in Subquadratic Time. Theor. Comput. Sci. 215(1-2): 123-136 (1999)
	1998
21		Wilfried Imrich, Sandi Klavzar, Aleksander Vesel: A characterization of halved cubes. Ars Comb. 48: (1998)
20		Wilfried Imrich: Factoring cardinal product graphs in polynomial time. Discrete Mathematics 192(1-3): 119-144 (1998)
19		Wilfried Imrich, Sandi Klavzar: A Convexity Lemma and Expansion Procedures for Bipartite Graphs. Eur. J. Comb. 19(6): 677-685 (1998)
	1997
18		Wilfried Imrich, Tomaz Pisanski, Janez Zerovnik: Recognizing Cartesian graph bundles. Discrete Mathematics 167-168: 393-403 (1997)
17		Wilfried Imrich, Sandi Klavzar: Recognizing Hamming Graphs in Linear Time and space. Inf. Process. Lett. 63(2): 91-95 (1997)
	1996
16		Wilfried Imrich, Janez Zerovnik: On the weak reconstruction of Cartesian-product graphs. Discrete Mathematics 150(1-3): 167-178 (1996)
15		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)
14		C. Paul Bonnington, Wilfried Imrich, Norbert Seifter: Geodesics in Transitive Graphs. J. Comb. Theory, Ser. B 67(1): 12-33 (1996)
	1995
13		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
12		Franz Aurenhammer, Johann Hagauer, Wilfried Imrich: Cartesian Graph Factorization at Logarithmic Cost per Edge. Computational Complexity 2: 331-349 (1992)
11		Wilfried Imrich, Jaroslav Nesetril: Simple tournaments and sharply transitive groups. Discrete Mathematics 108(1-3): 159-165 (1992)
10		Wilfried Imrich, Sandi Klavzar: Retracts of strong products of graphs. Discrete Mathematics 109(1-3): 147-154 (1992)
	1991
9		Wilfried Imrich, Norbert Seifter: A survey on graphs with polynomial growth. Discrete Mathematics 95(1-3): 101-117 (1991)
	1990
8		Franz Aurenhammer, Johann Hagauer, Wilfried Imrich: Factoring Cartesian-Product Graphs at Logarithmic Cost per Edge. IPCO 1990: 29-44
7		Wilfried Imrich, Gert Sabidussi: Focality and graph isomorphism. Discrete Mathematics 81(3): 237-245 (1990)
	1989
6		Wilfried Imrich, Norbert Seifter: A note on the growth of transitive graphs. Discrete Mathematics 73(1-2): 111-117 (1989)
5		Chris D. Godsil, Wilfried Imrich, Norbert Seifter, Mark E. Watkins, Wolfgang Woess: A note on bounded automorphisms of infinite graphs. Graphs and Combinatorics 5(1): 333-338 (1989)
	1987
4		Chris D. Godsil, Wilfried Imrich: Embedding graphs in Cayley graphs. Graphs and Combinatorics 3(1): 39-43 (1987)
	1984
3		Wilfried Imrich: Explicit construction of regular graphs without small cycles. Combinatorica 4(1): 53-59 (1984)
2		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		Wilfried Imrich: On the connectivity of cayley graphs. J. Comb. Theory, Ser. B 26(3): 323-326 (1979)

Coauthor Index

1	Franz Aurenhammer	[8] [12]
2	Kannan Balakrishnan	[43]
3	C. Paul Bonnington	[13] [14]
4	Bostjan Bresar	[27] [28] [29] [43]
5	Manoj Changat	[43]
6	Chris D. Godsil (C. D. Godsil)	[4] [5]
7	Ervin Györi	[25]
8	Johann Hagauer	[8] [12] [22]
9	Pavol Hell	[47]
10	Marc Hellmuth	[39] [42]
11	Janja Jerebic	[38]
12	Sandi Klavzar	[10] [15] [17] [19] [21] [22] [23] [24] [27] [28] [29] [30] [32] [36] [38] [40] [43] [46]
13	Werner Klöckl	[33] [39] [42] [45]
14	Matjaz Kovse	[41] [43]
15	Alenka Lipovec	[35]
16	Henry Martyn Mulder	[23]
17	Jaroslav Nesetril (Jarik Nesetril)	[11] [47]
18	Iztok Peterin	[34] [35] [44]
19	Tomaz Pisanski	[18] [37]
20	Douglas F. Rall	[36]
21	Gert Sabidussi	[7]
22	Norbert Seifter	[5] [6] [9] [14]
23	J. M. S. Simões-Pereira	[2]
24	Simon Spacapan	[44]
25	Peter F. Stadler	[31] [39] [42]
26	Ajitha R. Subhamathi	[43]
27	Vladimir Ivanovich Trofimov	[32]
28	Aleksander Vesel	[21]
29	Mark E. Watkins	[5] [13]
30	Wolfgang Woess	[5]
31	Christina Zamfirescu	[2]
32	Janez Zerovnik	[16] [18] [26]
33	Cun-Quan Zhang	[44]
34	Petra Zigert	[35]
35	Blaz Zmazek	[28]
36	Blaz Zniazek	[26]

Colors in the list of coauthors

Last update Sat Jun 2 20:57:36 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page