Richard, Hammack,; Wilfried, Imrich,; Sandi, Klavžar,

Handbook of product graphs (Book)

Second, CRC Press, Boca Raton, FL, 2011, ISSN: 978-1-4398-1304-1.

Wilfried, Imrich,; Sandi, Klavžar,

Two-ended regular median graphs (Article)

Discrete Math., 311, 15, Page(s): 1418--1422, 2011.

Wilfried, Imrich,; Werner, Klöckl,

Factoring directed graphs with respect to the cardinal product in polynomial time II (Article)

Discuss. Math. Graph Theory, 30, 3, Page(s): 461--474, 2010.

Wilfried, Imrich,; Iztok, Peterin,; Simon, Špacapan,; Cun-Quan, Zhang,

NZ-flows in strong products of graphs (Article)

J. Graph Theory, 64, 4, Page(s): 267--276, 2010.

Marc, Hellmuth,; Wilfried, Imrich,; Werner, Klöckl,; F., Stadler, Peter

Local algorithms for the prime factorization of strong product graphs (Article)

Math. Comput. Sci., 2, 4, Page(s): 653--682, 2009.

Kannan, Balakrishnan,; Boštjan, Brešar,; Manoj, Changat,; Wilfried, Imrich,; Sandi, Klavžar,; Matjaž, Kovše,; R., Subhamathi, Ajitha

On the remoteness function in median graphs (Article)

Discrete Appl. Math., 157, 18, Page(s): 3679--3688, 2009.

H., Hammack, Richard; Wilfried, Imrich,

On {C}artesian skeletons of graphs (Article)

Ars Math. Contemp., 2, 2, Page(s): 191--205, 2009.

Wilfried, Imrich,; Sandi, Klavžar,

Transitive, locally finite median graphs with finite blocks (Article)

Graphs Combin., 25, 1, Page(s): 81--90, 2009.

Wilfried, Imrich,; Matjaž, Kovše,

Lattice embeddings of trees (Article)

European J. Combin., 30, 5, Page(s): 1142--1148, 2009.

Marc, Hellmuth,; Wilfried, Imrich,; Werner, Klöckl,; F., Stadler, Peter

Approximate graph products (Article)

European J. Combin., 30, 5, Page(s): 1119--1133, 2009.

Wilfried, Imrich,; Sandi, Klavžar,; F., Rall, Douglas

Topics in graph theory (Book)

A K Peters Ltd., Wellesley, MA, 2008, ISSN: 978-1-56881-429-2.

Wilfried, Imrich,; Tomaž, Pisanski,

Multiple {K}ronecker covering graphs (Article)

European J. Combin., 29, 5, Page(s): 1116--1122, 2008.

Wilfried, Imrich,; Janja, Jerebic,; Sandi, Klavžar,

The distinguishing number of {C}artesian products of complete graphs (Article)

European J. Combin., 29, 4, Page(s): 922--929, 2008.

Wilfried, Imrich,; Werner, Klöckl,

Factoring directed graphs with respect to the cardinal product in polynomial time (Article)

Discuss. Math. Graph Theory, 27, 3, Page(s): 593--601, 2007.

Wilfried, Imrich,; Sandi, Klavžar,; F., Rall, Douglas

Cancellation properties of products of graphs (Article)

Discrete Appl. Math., 155, 17, Page(s): 2362--2364, 2007.

Wilfried, Imrich,; Sandi, Klavžar,; Vladimir, Trofimov,

Distinguishing infinite graphs (Article)

Electron. J. Combin., 14, 1, Page(s): Research Paper 36, 12 pp. (electronic), 2007.

Wilfried, Imrich,; Iztok, Peterin,

Recognizing {C}artesian products in linear time (Article)

Discrete Math., 307, 3-5, Page(s): 472--483, 2007.

Wilfried, Imrich,; Alenka, Lipovec,; Iztok, Peterin,; Petra, žigert,

Fast recognition of classes of almost-median graphs (Article)

Discrete Math., 307, 3-5, Page(s): 464--471, 2007.

Wilfried, Imrich,; Douglas, Rall,

Finite and infinite hypercubes as direct products (Article)

Australas. J. Combin., 36, Page(s): 83--90, 2006.

Wilfried, Imrich,; Sandi, Klavžar,

Distinguishing {C}artesian powers of graphs (Article)

J. Graph Theory, 53, 3, Page(s): 250--260, 2006.

Wilfried, Imrich,; F., Stadler, Peter

A prime factor theorem for a generalized direct product (Article)

Discuss. Math. Graph Theory, 26, 1, Page(s): 135--140, 2006.

Boštjan, Brešar,; Wilfried, Imrich,; Sandi, Klavžar,

Reconstructing subgraph-counting graph polynomials of increasing families of graphs (Article)

Discrete Math., 297, 1-3, Page(s): 159--166, 2005.

Boštjan, Brešar,; Wilfried, Imrich,; Sandi, Klavžar,; Blaž, Zmazek,

Hypercubes as direct products (Article)

SIAM J. Discrete Math., 18, 4, Page(s): 778--786 (electronic), 2005.

Wilfried, Imrich,; Blaž, Zmazek,; Janez, žerovnik,

Weak {$k$}-reconstruction of {C}artesian products (Article)

Discuss. Math. Graph Theory, 23, 2, Page(s): 273--285, 2003.

Boštjan, Brešar,; Wilfried, Imrich,; Sandi, Klavžar,

Tree-like isometric subgraphs of hypercubes (Article)

Discuss. Math. Graph Theory, 23, 2, Page(s): 227--240, 2003.

Wilfried, Imrich,; Peter, Mihók,; Gabriel, Semanišin,

A note on the unique factorization theorem for properties of infinite graphs (Article)

Stud. Univ. v Zilina Math. Ser., 16, 1, Page(s): 51--54, 2003.

Boštjan, Brešar,; Wilfried, Imrich,; Sandi, Klavžar,

Fast recognition algorithms for classes of partial cubes (Article)

Discrete Appl. Math., 131, 1, Page(s): 51--61, 2003.

Wilfried, Imrich,; Riste, Škrekovski,

A theorem on integer flows on {C}artesian products of graphs (Article)

J. Graph Theory, 43, 2, Page(s): 93--98, 2003.

Wilfried, Imrich,; F., Stadler, Peter

Minimum cycle bases of product graphs (Article)

Australas. J. Combin., 26, Page(s): 233--244, 2002.

Boštjan, Brešar,; Wilfried, Imrich,; Sandi, Klavžar,; Martyn, Mulder, Henry; Riste, Škrekovski,

Tiled partial cubes (Article)

J. Graph Theory, 40, 2, Page(s): 91--103, 2002.

Wilfried, Imrich,; Blaž, Zmazek,; Janez, žerovnik,

Weak {$k$}-reconstruction of {C}artesian product graphs (Incollection)

Comb01---{E}uroconference on {C}ombinatorics, {G}raph {T}heory and {A}pplications, Elsevier, .

Ervin, Gy{H{o}}ri,; Wilfried, Imrich,

On the strong product of a {$k$}-extendable and {$l$}-extendable graph (Article)

Graphs Combin., 17, 2, Page(s): 245--253, 2001.

Wilfried, Imrich,; Sandi, Klavžar,

Product graphs (Book)

Wiley-Interscience, New York, 2000, ISSN: 0-471-37039-8.

Wilfried, Imrich,; Sandi, Klavžar,

Recognizing graphs of acyclic cubical complexes (Inproceeding)

Proceedings of the {C}onference on {O}ptimal {D}iscrete {S}tructures and {A}lgorithms---{ODSA} '97 ({R}ostock), Page(s): 321--330, 1999.

Johann, Hagauer,; Wilfried, Imrich,; Sandi, Klavžar,

Recognizing median graphs in subquadratic time (Article)

Theoret. Comput. Sci., 215, 1-2, Page(s): 123--136, 1999.

Wilfried, Imrich,; Sandi, Klavžar,; Martyn, Mulder, Henry

Median graphs and triangle-free graphs (Article)

SIAM J. Discrete Math., 12, 1, Page(s): 111--118 (electronic), 1999.

Wilfried, Imrich,

Factoring cardinal product graphs in polynomial time (Article)

Discrete Math., 192, 1-3, Page(s): 119--144, 1998.

Wilfried, Imrich,; Sandi, Klavžar,

A convexity lemma and expansion procedures for bipartite graphs (Article)

European J. Combin., 19, 6, Page(s): 677--685, 1998.

Wilfried, Imrich,; Sandi, Klavžar,; Aleksander, Vesel,

A characterization of halved cubes (Article)

Ars Combin., 48, Page(s): 27--32, 1998.

Wilfried, Imrich,; Sandi, Klavžar,

Recognizing {H}amming graphs in linear time and space (Article)

Inform. Process. Lett., 63, 2, Page(s): 91--95, 1997.

Wilfried, Imrich,; Tomaž, Pisanski,; Janez, žerovnik,

Recognizing {C}artesian graph bundles (Article)

Discrete Math., 167/168, Page(s): 393--403, 1997.

Wilfried, Imrich,; Janez, žerovnik,

On the weak reconstruction of {C}artesian-product graphs (Article)

Discrete Math., 150, 1-3, Page(s): 167--178, 1996.

Paul, Bonnington, C.; Wilfried, Imrich,; Norbert, Seifter,

Geodesics in transitive graphs (Article)

J. Combin. Theory Ser. B, 67, 1, Page(s): 12--33, 1996.

Wilfried, Imrich,; Sandi, Klavžar,

On the complexity of recognizing {H}amming graphs and related classes of graphs (Article)

European J. Combin., 17, 2-3, Page(s): 209--221, 1996.

Wilfried, Imrich,; Sandi, Klavžar,; Aleksander, Vesel,

Recognizing halved cubes in a constant time per edge (Article)

European J. Combin., 16, 6, Page(s): 617--621, 1995.

Paul, Bonnington, C.; Wilfried, Imrich,; E., Watkins, Mark

Separating double rays in locally finite planar graphs (Article)

Discrete Math., 145, 1-3, Page(s): 61--72, 1995.

Wilfried, Imrich,; Janez, žerovnik,

Factoring {C}artesian-product graphs (Article)

J. Graph Theory, 18, 6, Page(s): 557--567, 1994.

Wilfried, Imrich,; Thomas, Müller,

On {H}owson's theorem (Article)

Arch. Math. (Basel), 62, 3, Page(s): 193--198, 1994.

Wilfried, Imrich,; Norbert, Sauer,; Wolfgang, Woess,

The average size of nonsingular sets in a graph (Incollection)

Finite and infinite combinatorics in sets and logic ({B}anff, {AB}, 1991), Kluwer Acad. Publ., .

W., Imrich,; S., Klavžar,

A simple {$O(mn)$} algorithm for recognizing {H}amming graphs (Article)

Bull. Inst. Combin. Appl., 9, Page(s): 45--56, 1993.

F., Aurenhammer,; J., Hagauer,; W., Imrich,

Cartesian graph factorization at logarithmic cost per edge (Article)

Comput. Complexity, 2, 4, Page(s): 331--349, 1992.

W., Imrich,; S., Klavžar,

Retracts of strong products of graphs (Article)

Discrete Math., 109, 1-3, Page(s): 147--154, 1992.

Wilfried, Imrich,; Jaroslav, Nešet{v{r}}il,

Simple tournaments and sharply transitive groups (Article)

Discrete Math., 108, 1-3, Page(s): 159--165, 1992.

W., Imrich,; N., Seifter,

A survey on graphs with polynomial growth (Article)

Discrete Math., 95, 1-3, Page(s): 101--117, 1991.

Wilfried, Imrich,; Aleš, Pultr,

Classification of tensor products of symmetric graphs (Article)

Comment. Math. Univ. Carolin., 32, 2, Page(s): 315--322, 1991.

W., Imrich,; S., Krsti{'c},; C., Turner, E.

On the rank of fixed point sets of automorphisms of free groups (Incollection)

Cycles and rays ({M}ontreal, {PQ}, 1987), Kluwer Acad. Publ., .

W., Imrich,; C., Turner, E.

Fixed subsets of homomorphisms of free groups (Incollection)

Topology and combinatorial group theory ({H}anover, {NH}, 1986/1987; {E}nfield, {NH}, 1988), Springer, .

W., Imrich,; G., Sabidussi,

Focality and graph isomorphism (Article)

Discrete Math., 81, 3, Page(s): 237--245, 1990.

Wilfried, Imrich,

Embedding graphs into {C}artesian products (Incollection)

Graph theory and its applications: {E}ast and {W}est ({J}inan, 1986), New York Acad. Sci., .

D., Godsil, Chris; Wilfried, Imrich,; Norbert, Seifter,; E., Watkins, Mark; Wolfgang, Woess,

A note on bounded automorphisms of infinite graphs (Article)

Graphs Combin., 5, 4, Page(s): 333--338, 1989.

W., Imrich,; C., Turner, E.

Endomorphisms of free groups and their fixed points (Article)

Math. Proc. Cambridge Philos. Soc., 105, 3, Page(s): 421--422, 1989.

W., Imrich,; N., Seifter,

A note on the growth of transitive graphs (Inproceeding)

Proceedings of the {O}berwolfach {M}eeting ``{K}ombinatorik'' (1986), Page(s): 111--117, 1989.

W., Imrich,; N., Seifter,

On groups of nonplanar, locally finite graphs of finite genus (Article)

Glas. Mat. Ser. III, 22(42), 2, Page(s): 295--300, 1987.

D., Godsil, Chris; Wilfried, Imrich,

Embedding graphs in {C}ayley graphs (Article)

Graphs Combin., 3, 1, Page(s): 39--43, 1987.

Wilfried, Imrich,; Norbert, Seifter,

A bound for groups of linear growth (Article)

Arch. Math. (Basel), 48, 2, Page(s): 100--104, 1987.

W., Imrich,; N., Seifter,

Automorphism groups of nonplanar, infinite graphs of finite genus (Incollection)

Graph theory ({D}ubrovnik, 1985), Univ. Novi Sad, .

G., Burns, R.; Wilfried, Imrich,; Brigitte, Servatius,

Remarks on the intersection of finitely generated subgroups of a free group (Article)

Canad. Math. Bull., 29, 2, Page(s): 204--207, 1986.

Wilfried, Imrich,; Rafa{l}, Kalinowski,

Periodic points of continuous mappings of trees (Incollection)

Cycles in graphs ({B}urnaby, {B}.{C}., 1982), North-Holland, .

Wilfried, Imrich,

Periodic points of small periods of continuous mappings of trees (Incollection)

Cycles in graphs ({B}urnaby, {B}.{C}., 1982), North-Holland, .

Wilfried, Imrich,

On automorphisms of graphs with forbidden subgraphs (Incollection)

Convexity and graph theory ({J}erusalem, 1981), North-Holland, .

Wilfried, Imrich,

Grushko's theorem (Article)

Arch. Math. (Basel), 43, 5, Page(s): 385--387, 1984.

Wilfried, Imrich,; S., Sim{~o}es-Pereira, J. M.; M., Zamfirescu, Christina

On optimal embeddings of metrics in graphs (Article)

J. Combin. Theory Ser. B, 36, 1, Page(s): 1--15, 1984.

Wilfried, Imrich,

Explicit construction of regular graphs without small cycles (Article)

Combinatorica, 4, 1, Page(s): 53--59, 1984.

Wilfried, Imrich,; Gabriele, Schwarz,

Trees and length functions on groups (Incollection)

Combinatorial mathematics ({M}arseille-{L}uminy, 1981), North-Holland, .

Herbert, Fleischner,; Wilfried, Imrich,

Transitive planar graphs (Article)

Math. Slovaca, 29, 2, Page(s): 97--106, 1979.

L., Babai,; W., Imrich,

Tournaments with given regular group (Article)

Aequationes Math., 19, 2-3, Page(s): 232--244, 1979.

C., Godsil,; W., Imrich,; R., Razen,

On the number of subgroups of given index in the modular group (Article)

Monatsh. Math., 87, 4, Page(s): 273--280, 1979.

Wilfried, Imrich,

On the connectivity of {C}ayley graphs (Article)

J. Combin. Theory Ser. B, 26, 3, Page(s): 323--326, 1979.

W., Imrich,

Graphical regular representations of groups of odd order (Incollection)

Combinatorics ({P}roc. {F}ifth {H}ungarian {C}olloq., {K}eszthely, 1976), {V}ol. {II}, North-Holland, .

Wilfried, Imrich,

On metric properties of tree-like spaces (Incollection)

Contributions to graph theory and its applications ({I}nternat. {C}olloq., {O}berhof, 1977) ({G}erman), Tech. Hochschule Ilmenau, .

Wilfried, Imrich,

Subgroup theorems and graphs (Incollection)

Combinatorial mathematics, {V} ({P}roc. {F}ifth {A}ustral. {C}onf., {R}oy. {M}elbourne {I}nst. {T}ech., {M}elbourne, 1976), Springer, .

Wilfried, Imrich,

On finitely generated subgroups of free groups (Article)

Arch. Math. (Basel), 28, 1, Page(s): 21--24, 1977.

W., Imrich,; E., Watkins, M.

On automorphism groups of {C}ayley graphs (Article)

Period. Math. Hungar., 7, 3-4, Page(s): 243--258, 1976.

Wilfried, Imrich,; Herbert, Izbicki,

Associative products of graphs (Article)

Monatsh. Math., 80, 4, Page(s): 277--281, 1975.

Wilfried, Imrich,

On graphs with regular groups (Article)

J. Combinatorial Theory Ser. B, 19, 2, Page(s): 174--180, 1975.

Wilfried, Imrich,

On {W}hitney's theorem on the unique embeddability of {$3$}-connected planar graphs (Incollection)

Recent advances in graph theory ({P}roc. {S}econd {C}zechoslovak {S}ympos., {P}rague, 1974), Academia, .

W., Imrich,

On graphical regular representations of groups (Incollection)

Infinite and finite sets ({C}olloq., {K}eszthely, 1973; dedicated to {P}. {E}rd{H o}s on his 60th birthday), {V}ol. {II}, North-Holland, .

Wilfried, Imrich,; Franz, Schnitzer,

Eine {C}harakterisierung konvexer {M}engen (Article)

Arch. Math. (Basel), 26, Page(s): 322--326, 1975.

L., Babai,; W., Imrich,

Sense preserving groups of polyhedral graphs (Article)

Monatsh. Math., 79, Page(s): 1--2, 1975.

Wilfried, Imrich,; E., Watkins, Mark

On graphical regular representations of cyclic extensions of groups (Article)

Pacific J. Math., 55, Page(s): 461--477, 1974.

L., Babai,; W., Imrich,; L., Lov{'a}sz,

Finite homeomorphism groups of the {$2$}-sphere (Incollection)

Topics in topology ({P}roc. {C}olloq., {K}eszthely, 1972), North-Holland, .

L., Babai,; W., Imrich,

On groups of polyhedral graphs (Article)

Discrete Math., 5, Page(s): 101--103, 1973.

Willibald, Dörfler,; Wilfried, Imrich,

Eine {K}lasse rekonstruierbarer {G}raphen (Article)

Glasnik Mat. Ser. III, 7(27), Page(s): 159--165, 1972.

Wilfried, Imrich,

Assoziative {P}rodukte von {G}raphen (Article)

"Osterreich. Akad. Wiss. Math.-Natur. Kl. S.-B. II, 180, Page(s): 203--239, 1972.

Wilfried, Imrich,

On products of graphs and regular groups (Article)

Israel J. Math., 11, Page(s): 258--264, 1972.

Willibald, Dörfler,; Wilfried, Imrich,

Das lexikographische {P}rodukt gerichteter {G}raphen (Article)

Monatsh. Math., 76, Page(s): 21--30, 1972.

V., Imrih,; {`E}., Stocki{ui},

The optimal embeddings of metrics into graphs (Article)

Sibirsk. Mat. v Z., 13, Page(s): 558--565, 1972.

Günter, Gaszt,; Wilfried, Imrich,

"{U}ber das lexikographische und das kostarke {P}rodukt von {M}engensystemen (Article)

Aequationes Math., 7, Page(s): 82--93, 1971.

Wilfried, Imrich,

Zehnpunktige kubische {G}raphen (Article)

Aequationes Math., 6, Page(s): 6--10, 1971.

V., Imrih,; {`E}., Stocki{ui},

Optimal embeddings of metrics into graphs (Article)

Dokl. Akad. Nauk SSSR, 200, Page(s): 279--281, 1971.

Wilfried, Imrich,

"{U}ber das schwache {K}artesische {P}rodukt von {G}raphen (Article)

J. Combinatorial Theory Ser. B, 11, Page(s): 1--16, 1971.

W., Dörfler,; W., Imrich,

"{U}ber die {$X$}-{S}umme von {M}engensystemen (Incollection)

Combinatorial theory and its applications, {I} ({P}roc. {C}olloq., {B}alatonf"ured, 1969), North-Holland, .

Willibald, Dörfler,; Wilfried, Imrich,

"{U}ber das starke {P}rodukt von endlichen {G}raphen (Article)

"Osterreich. Akad. Wiss. Math.-Natur. Kl. S.-B. II, 178, Page(s): 247--262, 1970.

Wilfried, Imrich,

Realisierung von {M}etriken in {G}raphen (Article)

"Osterreich. Akad. Wiss. Math.-Natur. Kl. S.-B. II, 178, Page(s): 19--24, 1970.

Wilfried, Imrich,

Automorphismen und das kartesische {P}rodukt von {G}raphen (Article)

"Osterreich. Akad. Wiss. Math.-Natur. Kl. S.-B. II, 177, Page(s): 203--214, 1969.

Wilfried, Imrich,

Graphen mit transitiver {A}utomorphismengruppe (Article)

Monatsh. Math., 73, Page(s): 341--347, 1969.

Wilfried, Imrich,

"{U}ber das lexikographische {P}rodukt von {G}raphen (Article)

Arch. Math. (Basel), 20, Page(s): 228--234, 1969.

G., Baron,; W., Imrich,

Asymmetrische regul"are {G}raphen (Article)

Acta Math. Acad. Sci. Hungar, 20, Page(s): 135--142, 1969.

G., Baron,; W., Imrich,

On the maximal distance of spanning trees (Article)

J. Combinatorial Theory, 5, Page(s): 378--385, 1968.

Wilfried, Imrich,

A single axiom for {$A$}-groups (Article)

Glasnik Mat. Ser. III, 3 (23), Page(s): 3--9, 1968.

Wilfried, Imrich,

Abelian groups with identical relations (Article)

Czechoslovak Math. J., 17 (92), Page(s): 535--539, 1967.

W., Imrich,

Kartesisches {P}rodukt von {M}engensystemen und {G}raphen (Article)

Studia Sci. Math. Hungar., 2, Page(s): 285--290, 1967.

Gerd, Baron,; Wilfried, Imrich,

Charakterisierung von {G}ruppenklassen mit {H}ilfe der inversen {O}peration (Article)

Monatsh. Math., 70, Page(s): 289--298, 1966.

Wilfried, Imrich,

On the number of subgroups of given index in {${rm SL}_{2}(Z)$} (Article)

Arch. Math. (Basel), 31, 3, Page(s): 224--231, 0000.