wilfried.imrich

Papers

List of papers

Publications in print

Publications

110. Factoring directed graphs with respect to the cardinal product in polynomial time II

Imrich, Wilfried; Klöckl, Werner
Discuss. Math. Graph Theory Accepted 12.10.2009

109. On Cartesian Skeletons of Graphs

Hammack and Imrich,
Ars Mathematica Contemporanea, 2 (2009), 191-205

108. Local Algorithms for the Prime Factorization of Strong Product Graphs

Hellmuth, Marc; Imrich, Wilfried; Klöckl, Werner; Stadler, Peter F.
Mathematics in Computer Science 2 (2009), 1661—8270.

104. Approximative graph products

Hellmuth, Marc; Imrich, Wilfried; Klöckl, Werner; Stadler, Peter F.
European J. Combin. 30 (2009), 1119—1133

103. Multiple Kronecker Covering Graphs

(with Tomaž Pisanski), Europ. J. Combinatorics 29 (2008), 1116 – 1122

102. The distinguishing number of Cartesian products of complete graphs

(with Janja Jerebic and Sandi Klavžar), Europ. J. Combinatorics 29 (2008), 922 – 929

101. Factoring Directed Graphs with respect to the Cardinal Product in Polynomial Time

(with Werner Klöckl), Discussiones Mathematicae Graph Theory 27 (2007), 593 – 601

100. Cancellation properties of products of graphs

(with Sandi Klavžar and Douglas F. Rall), Discrete Applied Mathematics 155 (2007) 2362 – 2364

099. Characterization of Trivalent Graphs with Minimal Eigenvalue Gap

(with C. Brand and B. Guiduli), Croat. Chem. Acta 80 (2007), 193 – 201

098. Distinguishing infinite graphs

(with Sandi Klavžar and Vladimir Trofimov), Electron. J. Comb. 14 (2007), 1 – 12

097. Recognizing Cartesian products in linear time

(with I. Peterin), Discrete Mathematics 307 (2007), 472 – 483

096. Fast recognition of classes of almost-median graphs

(with A. Lipovec, I. Peterin and P. Žigert), Discrete Mathematics 307 (2007), 464 – 471

095. Distinguishing Cartesian powers of graphs

(Sandi Klavžar), J. Graph Theory 53 (2006), 250 – 260

094. Finite and Infinite Hypercubes as Direct Products

(with Douglas Rall), Austral. J. Comb. 36 (2006), 83 – 90

093. Prime Factor Theorem for a Generalized Direct Product

(with Peter Stadler), Discussiones Mathematicae Graph Theory 26 (2006), 135 – 140

092. Reconstructing subgraph-counting graph polynomials of increasing families of graphs

(with B. Brešar and S. Klavžar), Discrete Mathematics 297 (2005), 159 – 166

091. Hypercubes as direct products

(with B. Brešar, S. Klavžar and B. Zmazek), SIAM J. Discrete Math. 18 (2005), 779 – 786

090. A note on the Unique Factorization Theorem for Properties of Infinite Graphs

(with P. Mihók and G. Semanišin), Studies of the University of Žilina, Mathematical Series, 16 (2003), 1 – 4

089. Tree-like isometric subgraphs of hypercubes

(with B. Brešar and S. Klavžar), Discussiones Mathematicae Graph Theory 23 (2003), 227 – 240

088. Weak k-reconstruction of Cartesian products

(with J. Žerovnik and B. Zmazek), Discussiones MathematicaeGraph Theory 23 (2003), 273 – 285

087. Fast recognition algorithms for classes of partial cubes

(with B. Brešar and S. Klavžar), Discrete Appl. Math. 131 (2003), 51 – 61

086. A theorem on integer flows on Cartesian products of graphs

(mit R. Škrekovski), J. Graph Theory 43 (2003), 93 – 98

085. Minimum Cycle Bases of Product Graphs

(with P. Stadler), Australasian J. Comb. 26 (2002), 233 – 244

084. Tiled partial cubes

(with B. Brešar, S. Klavžar, M. Mulder and R. Škrekovski), J. Graph Theory 40 (2002), 91 – 103

083. On the strong product of a k-extendable graph and an l-extendable graph

(with E. Györi) Graphs Combin. 17 (2001), 245–253.

082a. Wilfried Imrich, Gert Sabidussi zum 70. Geburtstag

Internat. Math. Nachrichten 185 (2000), 1 - 10

082. Recognizing Graphs of Acyclic Cubical Complexes

(with S. Klavžar), Discrete Appl. Math. 95 (1999), 321 - 330

081. Median Graphs and triangle-free graphs

(with S. Klavžar and M. Mulder), SIAM J. Discrete Mathematics 12 (1999), 111 - 118

080. Recognizing median graphs in subquadratic time

(with J. Hagauer and S. Klavžar) J. Theoretical Computer Science 215 (1999), 123 – 136

079. Factoring Cardinal Product Graphs in Polynomial Time

Discrete Mathematics 192 (1998), 119 – 144

078. A Convexity Lemma and Expansion Procedures for Bipartite Graphs

(with S. Klavžar), Europ. J. Combinatorics 19 (1998), 677 – 685

077. A characterization of halved cubes

(with S. Klavžar and A. Vesel), Ars Combinatoria 48 (1998), 27 – 32

076. Recognizing Hamming graphs in linear time and space

(with S. Klavžar), Information Processing Letters 63 (1997), 91 – 95

075. Recognizing Cartesian graph bundles

(with T. Pisanski and J. Žerovnik), Discrete Mathematics 167/168 (1997), 393 – 403

074. Geodesics in transitive graphs

(with P. Bonnington and N. Seifter), J. Combinatorial Theory, Ser. B,67 (1996), 12 – 33

073. On the Weak Reconstruction of Cartesian-Product Graphs

(with J. Žerovnik), Discrete Mathematics 150 (1996), 167 – 178

072. On the complexity of recognizing Hamming graphs and related classes of graphs

(with S. Klavžar), Europ. J. Combinatorics 17 (1996), 209 – 221

071. Separating Double Rays in Locally Finite Planar Graphs

(with P. Bonnington and M. E. Watkins), Discrete Mathematics 145 (1995), 61 – 72

070. Recognizing halved cubes in constant time per edge

(with S. Klavžar and A. Vesel), Europ. J. Combinatorics 16 (1995), 617 – 621

069. On Howson’s Theorem

(with Th. Müller), Arch. Math. (Basel) 62 (1994), 193 – 198

068. Factoring Cartesian-Product Graphs

(with J. Zerovnik), J. Graph Th. 18 (1994), 557 – 567

067. A simple 0(mn)-algorithm for recognizing Hamming graphs

(with S. Klavžar), Bull. ICA 9 (1993), 45 – 56

066. The average size of nonsingular sets in a graph

(with N. Sauer and W. Woess), in N.W. Sauer et al. (eds) Finite and Infinite Combinatorics in Sets and Logic, 199-205; 1993 Kluwer Academic Publishers

065b. Factoring Cartesian-product graphs at logarithmic cost per edge

(with F. Aurenhammer and J. Hagauer), Proceedings of the Conferenceon Integer Programing and Combinatorial Optimization held at the University of Waterloo, May 28 – 30 1990, University of Waterloo Press 1990, 29 – 44

065a. Cartesian graph factorization at logarithmic cost per edge

(with F. Aurenhammer and J. Hagauer), Comp. Complexity 2 (1992), 331 - 349

064. Retracts of strong products of graphs

(with S. Klavžar),Discrete Mathematics 109 (1992), 147 – 154

063. Simple tournaments and sharply transitive groups

(with J. Nešetřil), Discrete Mathematics 108 (1992), 159 – 165

062. A survey on graphs with polynomial growth

(with N. Seifter), Discrete Mathematics 95 (1991), 101 – 117; MR 92j:05090

061. Classification of tensor products of symmetric graphs

(with A.Pultr), Comment. Math. Carolinae 32 (1991), 315 – 322

060. Fixed subsets of homomorphisms of free groups

(with E. C. Turner), Lecture Notes in Mathematics 1440 (1990), 186 – 191

059. Focality and Graph Isomorphisms

(with G. Sabidussi), Discrete Mathematics 81 (1990), 237 – 245

058. On the rank of fixed point sets of automorphisms of free groups

(with S. Kristić and E. C. Turner), Cycles and Rays, NATO ASI Ser. C, Kluwer Academic Publishers, Dordrecht 1990, 113 – 122

057. Embedding graphs into Cartesian products

Proceedings of the First China-USA International Conference on Graph Theory and its Applications, Annals New York Academy of Sciences 576 (1989), 266 – 274; MR 92j:05062

056. A note on bounded automorphisms of infinite graphs

(with C. Godsil, N. Seifter, M. Watkins and W. Woess), Graphs and Combinatorics 5 (1989), 339 – 349

055. Endomorphisms of free groups and their fixed points

(with E. C. Turner), Math. Proc. Camb. Phil. Soc. 105 (1989), 421 – 422

054. A note on the growth of transitive graphs

(with N. Seifter), Discrete Mathematics 73 (1988/89), 111 – 117

053. On groups of nonplanar locally finite graphs of finite genus

(with N. Seifter), Glasnik Mat. 22 (1987), 295 – 300

052. Embedding graphs in Cayley graphs

(with C.D. Godsil), Graphs and Combinatorics 3 (1987), 39 – 43

051. A bound for groups of linear growth

(with N.Seifter), Arch. Math. 48 (1987), 100 – 104

050. Remarks on the intersection of finitely generated subgroups of a free group

(with R.G. Burns and B. Servatius), Canad. Math. Bull. 29 (1986), 204 – 207

049. Automorphism groups of nonplanar infinite graphs of finite genus

(with N. Seifter), Proc. Sixth Yugosl. Seminar on Graph Theory, Dubrovnik 1985, 115 – 123

048. Periodic points of small periods of continuous mappings of trees

Ann. Discrete Math. 27 (1985), 443 – 446

047. Periodic points of continuous mappings of trees

(with R. Kalinowski), Ann. Discrete Math. 27 (1985), 447 – 460

046. Grushko’s theorem

Archiv Math. 43 (1984), 385 – 387

045. On optimal embeddings of metrics in graphs

(with J.M.S. Sim˜oes-Pereira and C. Zamfirescu), J. Combinatorial Theory Ser.B 36 (1984), 1 – 15

044. Explicit construction of regular graphs without small cycles

Combinatorica 4 (1984), 53 – 59

043. On automorphisms of graphs with forbidden subgraphs

Ann. Discrete Math. 20 (1984), 183 – 188,

042. Trees and length functions on groups

(with Gabriele Schwarz), Ann. Discrete Math. 17 (1983), 347 – 359

041. Tournaments with given regular groups

(with L. Babai), Aequationes Mathematicae 19 (1979), 232 – 244; MR 81a:05060

040. On the number of subgroups of given index in the modular group

(with C. Godsil and R. Razen), Monatsh. Math. 87 (1979), 273 – 280; MR 80k:10019

039. Transitive planar graphs

(with H. Fleischner), Mathematika Slovaca 29 (1979), 97 – 105; MR 81f:05093

038. On the connectivity of Cayley graphs

J. Combinatiorial Theory Ser. B 26 (1979), 323 – 326; MR 80j:05072

037. On the number of subgroups of given index in SL2(ZZ)

Archiv Math. (Basel) 31 (1978), 224 – 231; MR 80c:20062

036. On metric properties of tree-like spaces, Beiträge zur Graphentheorie und deren Anwendungen

Oberhof (DDR), (1977), 129 – 156; Edited by Sektion MAROEK der Technischen Hochschule Ilmenau; MR 82e:05059

035. On finitely generated subgroups of free groups

Archiv Math. (Basel) 28 (1977), 21 – 24; MR 55 #12822

034. Subgroup theorems and graphs

Combinatorial Mathematics V, Lecture Notes in Mathematics Vol. 622, Springer 1977, 1 – 27, MR 57 #2980

033. Graphical regular representations of groups of odd order

Coll. Math. Soc. János Bolyai 18, Combinatorics, Keszthely (Hungary), (1976), 611 – 621; MR 80c:05081

032. On automorphism groups of Cayley graphs

(with M. Watkins), Periodica Math. Hung. 7 (1976), 243 – 258; MR 56 #15483

031. Associative products of graphs

(with H. Izbicki), Monatsh. Mathematik 80 (1975), 277 – 281; MR 53 #7864

030. On graphs with regular groups

J. Combinatorial Theory, Ser. B 19 (1975), 174 – 180; MR 52 #13477

029. Eine Charakterisierung konvexer Mengen

(with F. Schnitzer). Archiv. Math. (Basel) 26 (1975), 322 – 326; MR 51 #8957

028. On Whitney’s Theorem on the unique emdeddabilitzy of 3-connected planar graphs, Recent Advances in Graph Theory

Proceedings of the symposium held in Prague, June 1974, Academia Praha 1975, 303 – 306; MR 52 #5462

027. Sense preserving groups of polyhedral graphs

(with L. Babai), Monatsh. Math. 79 (1975), 1 – 2, MR 50 #12794

026. On graphical regular representations of groups, Infinite and Finite Sets

Colloq. Math. Soc. János Bolyai, 10, Keszthely, Hungary, 1973, North-Holland, Amsterdam, 1975, 905 – 925; MR 51 #12594

025. On graphical regular representations of cyclic extensions of groups

(with M. Watkins), Pacific J. of Math. 54 (1974), 461 – 478; MR 52 #174

024. Finite homeomorphism groups of the 2-sphere

(with L. Babai and L. Lovász), Császár ed., Topics in Topology, Colloq. Math. Soc. János Bolyai, 8, Keszthely, Hungary, 1972, North-Holland, Amsterdam, 1973, 61 – 75; MR 50 #84

023. On groups of polyhedral graphs

(with L. Babai), Discrete Math. 5 (1973), 101 – 103; MR 47 #3232

022. Eine Klasse rekonstruierbarer Graphen

(with W. Dörfler), Glasnik Mat. 7 (1972), 159 – 165; MR 47 #6555

021. On products of graphs and regular groups

Israel J. Math. 11 (1972), 258 – 264; MR #3234 1

020. Das lexikographische Produkt gerichteter Graphen

(with W. Dörfler), Monatsh. Math. 76 (1972), 21 – 30; MR 46 #8891

019. Über das lexikographische und das kostarke Produkt von Mengensystemen

(with G. Gaszt), Aequationes Mathematicae 7 (1972), 82 – 93; MR 46 #164

018c. E. Optimal imbeddings of metrics in graphs

English translation: Imrih, V.; Stockii, Sib. Math. J. 13 (1972); (1973), 382-387

018b. Optimal embeddings of metrics in graphs

(with E. Stozkiĭ, Russian), Sibirskiĭ Mat. Šurnal, 13 (1972), 558 – 565; MR 45 #6675.

018a. On optimum embeddings of metrics in graphs

(with E. Stozkiĭ, Russian), Dokl. Akad. Nauk SSSR 200 (1971), 279 – 281; MR 45 #106. English translation: Imrih, V.; Stockii, E. On optimum embeddings of metrics in graphs, Sov. Math. Dokl. 12 (1971), 1379 – 1382

017. Über das schwache kartesische Produkt von Graphen

J. Combinatorial Theory Ser. B 11 (1971), 1 – 16; MR 43

016. Assoziative Produkte von Graphen

Österr. Akad. Wiss. Math. Naturw. Kl. S.-B. II. 180 (1971), 203 – 239; MR 47 #4863

015. Zehnpunktige kubische Graphen

Aequationes Mathematicae 6 (1971), 6 – 10; MR 45 #1792

014. Graphs with transitive abelian automorphism group

Coll. Math. Soc. János Bolyai 4, Comb. Theory and its Appl., Balatonfüred (Ungarn), (1969), 651 – 656

013. Über die X-Summe von Mengensystemen

(with W. Dörfler), Coll. Math. Soc. János Bolyai 4, Comb. Theory and its Appl., Balatonfüred (Ungarn), (1969), 297 – 309; MR 45 #6692

012. Über das starke Produkt von endlichen Graphen

(with W. Dörfler), Österr. Akad. Wiss. Math. Naturw. Kl. S.-B. II. 178 (1969), 247 – 262; MR 44 #2672

011. Realisierung von Metriken in Graphen

Österr. Akad. Wiss. Math. Naturw. Kl. S.-B. II. 178 (1970), 19 – 24; MR 42 #5860

010. Graphen with transitiver Automorphismengruppe

Monatsh. Math. 73 (1969), 341 – 347; MR 41 #108

009. Über das lexikographische Produkt von Graphen

Arch. Math. (Basel) 20 (1969), 228 – 234; MR 39 #5396

008. Asymmetrische reguläre Graphen

(with G. Baron), Acta Math. Acad. Sci. Hungar. 20 (1969), 135 – 142; MR 39 #90

007. Automorphismen und das kartesische Produkt von Graphen

Österr. Akad. Wiss. Math. Naturw. Kl. S.-B. II. 177 (1968), 203 – 214; MR 43 #107

006. On the maximal distance of spanning trees

(with G. Baron), J. Comb. Th. 5 (1968), 378 – 385; MR 38 #2048

005. A single axiom for A-groups

Glasnik Mat. 3 (1968), 3 – 9; MR 38 #1201

004. Kartesisches Produkt vom Mengensystemen und Graphen

Studia Sci. Math. Hungar. 2 (1967), 285 – 290; MR 36 #1352

003. Abelian groups with identical relations

Czechoslovak. Math. J. 17 (1967), 535 – 539; MR 36 #1535

002. Charakterisierung von Gruppenklassen mit Hilfe der inversen Operation

(with G. Baron), Monatsh. Math. 70 (1966), 289 – 298; MR 33 #4123

001. Über Gitter und Volumen

Dissertation Universität Wien, 1965

Copyright

Not to infringe on the copyright of the material in this page please observe:

Any redestribution or reporduction of part or all of the contents in any form is prohibited other than the following:
• you may print or download to a local hard disk extracts for your personal and non-commercial use only
• you may copy the content to individual third parties for their personal use, but only if you acknowledge the website as the source of the material
You may not, except with express written permission, distribute or commercially exploit the content. Nor may you transmit it or store it in any other website or other form of electronic retrieval system.