default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWilfried Imrich
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j75]Wilfried Imrich
, Rafal Kalinowski, Monika Pilsniak, Mariusz Wozniak:
On Asymmetric Colourings of Claw-Free Graphs. Electron. J. Comb. 28(3): 3 (2021)- [j74]Maryam Abdi, Ebrahim Ghorbani, Wilfried Imrich:
Regular graphs with minimum spectral gap. Eur. J. Comb. 95: 103328 (2021) - 2020
- [j73]Wilfried Imrich, Rafal Kalinowski, Monika Pilsniak, Mariusz Wozniak:
The distinguishing index of connected graphs without pendant edges. Ars Math. Contemp. 18(1): 117-126 (2020) - [j72]Wilfried Imrich, Florian Lehner, Simon M. Smith:
Distinguishing density and the Distinct Spheres Condition. Eur. J. Comb. 89: 103139 (2020)
2010 – 2019
- 2019
- [j71]Mariusz Grech, Wilfried Imrich, Anna Dorota Krystek, Lukasz Jan Wojakowski:
Direct product of automorphism groups of digraphs. Ars Math. Contemp. 17(1): 89-101 (2019) - [j70]Svenja Hüning, Wilfried Imrich, Judith Kloas, Hannah Schreiber, Thomas W. Tucker:
Distinguishing Graphs of Maximum Valence 3. Electron. J. Comb. 26(4): 4 (2019) - [j69]Izak Broere, Wilfried Imrich, Rafal Kalinowski, Monika Pilsniak:
Asymmetric colorings of products of graphs and digraphs. Discret. Appl. Math. 266: 56-64 (2019) - 2018
- [j68]Richard H. Hammack, Wilfried Imrich:
Vertex-Transitive Direct Products of Graphs. Electron. J. Comb. 25(2): 2 (2018) - [j67]Wilfried Imrich, Iztok Peterin:
Cartesian products of directed graphs with loops. Discret. Math. 341(5): 1336-1343 (2018) - 2017
- [j66]Wilfried Imrich, Rafal Kalinowski, Monika Pilsniak, Mohammad Hadi Shekarriz:
Bounds for Distinguishing Invariants of Infinite Graphs. Electron. J. Comb. 24(3): 3 (2017) - [j65]Ehsan Estaji, Wilfried Imrich, Rafal Kalinowski, Monika Pilsniak, Thomas W. Tucker:
Distinguishing Cartesian products of countable graphs. Discuss. Math. Graph Theory 37(1): 155-164 (2017) - [i4]Marc Hellmuth, Wilfried Imrich, Werner Klöckl, Peter F. Stadler:
Local algorithms for the prime factorization of strong product graphs. CoRR abs/1705.03823 (2017) - 2016
- [j64]Tetiana Boiko, Johannes Cuno, Wilfried Imrich, Florian Lehner, Christiaan E. van de Woestijne:
The Cartesian product of graphs with loops. Ars Math. Contemp. 11(1): 1-9 (2016) - [j63]Wilfried Imrich, Ali Iranmanesh, Sandi Klavzar, Abolghasem Soltani:
Edge-transitive lexicographic and Cartesian products. Discuss. Math. Graph Theory 36(4): 857-865 (2016) - 2015
- [j62]Marc Hellmuth, Wilfried Imrich, Tomas Kupka:
Fast recognition of partial star products and quasi cartesian products. Ars Math. Contemp. 9(2): 223-242 (2015) - [j61]L. Sunil Chandran, Wilfried Imrich, Rogers Mathew, Deepak Rajendraprasad:
Boxicity and cubicity of product graphs. Eur. J. Comb. 48: 100-109 (2015) - 2014
- [j60]Johannes Cuno, Wilfried Imrich, Florian Lehner:
Distinguishing graphs with infinite motion and nonlinear growth. Ars Math. Contemp. 7(1): 201-213 (2014) - [j59]Richard H. Hammack, Wilfried Imrich:
Fast recognition of direct and strong products. Ars Math. Contemp. 7(2): 487-497 (2014) - [j58]Wilfried Imrich, Rafal Kalinowski, Florian Lehner, Monika Pilsniak:
Endomorphism Breaking in Graphs. Electron. J. Comb. 21(1): 1 (2014) - [j57]Debra L. Boutin, Wilfried Imrich:
Infinite Graphs with Finite 2-Distinguishing Cost. Electron. J. Comb. 21(4): 4 (2014) - 2013
- [j56]Marc Hellmuth, Wilfried Imrich, Tomas Kupka:
Partial Star Products: A Local Covering Approach for the Recognition of Approximate Cartesian Product Graphs. Math. Comput. Sci. 7(3): 255-273 (2013) - [i3]Marc Hellmuth, Wilfried Imrich, Tomas Kupka:
Partial Star Products: A Local Covering Approach for the Recognition of Approximate Cartesian Product Graphs. CoRR abs/1303.6803 (2013) - [i2]L. Sunil Chandran, Wilfried Imrich, Rogers Mathew, Deepak Rajendraprasad:
Boxicity and Cubicity of Product Graphs. CoRR abs/1305.5233 (2013) - [i1]Marc Hellmuth, Wilfried Imrich, Tomas Kupka:
Fast Recognition of Partial Star Products and Quasi Cartesian Products. CoRR abs/1308.2101 (2013) - 2012
- [j55]Pavol Hell, Wilfried Imrich, Jaroslav Nesetril:
Preface. Discret. Math. 312(1): 1 (2012) - 2011
- [j54]Wilfried Imrich, Sandi Klavzar:
Two-ended regular median graphs. Discret. Math. 311(15): 1418-1422 (2011) - 2010
- [j53]Wilfried Imrich, Werner Klöckl:
Factoring directed graphs with respect to the cardinal product in polynomial time II. Discuss. Math. Graph Theory 30(3): 461-474 (2010) - [j52]Wilfried Imrich, Iztok Peterin, Simon Spacapan, Cun-Quan Zhang:
NZ-flows in strong products of graphs. J. Graph Theory 64(4): 267-276 (2010)
2000 – 2009
- 2009
- [j51]Richard H. Hammack, Wilfried Imrich:
On Cartesian skeletons of graphs. Ars Math. Contemp. 2(2): 191-205 (2009) - [j50]Kannan Balakrishnan, Bostjan Bresar, Manoj Changat, Wilfried Imrich, Sandi Klavzar, Matjaz Kovse, Ajitha R. Subhamathi:
On the remoteness function in median graphs. Discret. Appl. Math. 157(18): 3679-3688 (2009) - [j49]Marc Hellmuth, Wilfried Imrich, Werner Klöckl, Peter F. Stadler:
Approximate graph products. Eur. J. Comb. 30(5): 1119-1133 (2009) - [j48]Wilfried Imrich, Matjaz Kovse:
Lattice embeddings of trees. Eur. J. Comb. 30(5): 1142-1148 (2009) - [j47]Wilfried Imrich, Sandi Klavzar:
Transitive, Locally Finite Median Graphs with Finite Blocks. Graphs Comb. 25(1): 81-90 (2009) - [j46]Marc Hellmuth, Wilfried Imrich, Werner Klöckl, Peter F. Stadler:
Local Algorithms for the Prime Factorization of Strong Product Graphs. Math. Comput. Sci. 2(4): 653-682 (2009) - 2008
- [j45]Wilfried Imrich, Janja Jerebic, Sandi Klavzar:
The distinguishing number of Cartesian products of complete graphs. Eur. J. Comb. 29(4): 922-929 (2008) - [j44]Wilfried Imrich, Tomaz Pisanski:
Multiple Kronecker covering graphs. Eur. J. Comb. 29(5): 1116-1122 (2008) - 2007
- [j43]Wilfried Imrich, Sandi Klavzar, Vladimir Ivanovich Trofimov:
Distinguishing Infinite Graphs. Electron. J. Comb. 14(1) (2007) - [j42]Wilfried Imrich, Sandi Klavzar, Douglas F. Rall:
Cancellation properties of products of graphs. Discret. Appl. Math. 155(17): 2362-2364 (2007) - [j41]Wilfried Imrich, Alenka Lipovec, Iztok Peterin, Petra Zigert:
Fast recognition of classes of almost-median graphs. Discret. Math. 307(3-5): 464-471 (2007) - [j40]Wilfried Imrich, Iztok Peterin:
Recognizing Cartesian products in linear time. Discret. Math. 307(3-5): 472-483 (2007) - [j39]Wilfried Imrich, Werner Klöckl:
Factoring directed graphs with respect to the cardinal product in polynomial time. Discuss. Math. Graph Theory 27(3): 593-601 (2007) - 2006
- [j38]Wilfried Imrich, Douglas F. Rall:
Finite and infinite hypercubes as direct products. Australas. J Comb. 36: 83-90 (2006) - [j37]Wilfried Imrich, Peter F. Stadler:
A prime factor theorem for a generalized direct product. Discuss. Math. Graph Theory 26(1): 135-140 (2006) - [j36]Wilfried Imrich, Sandi Klavzar:
Distinguishing Cartesian powers of graphs. J. Graph Theory 53(3): 250-260 (2006) - 2005
- [j35]Bostjan Bresar, Wilfried Imrich, Sandi Klavzar:
Reconstructing subgraph-counting graph polynomials of increasing families of graphs. Discret. Math. 297(1-3): 159-166 (2005) - [j34]Bostjan Bresar, Wilfried Imrich, Sandi Klavzar, Blaz Zmazek:
Hypercubes As Direct Products. SIAM J. Discret. Math. 18(4): 778-786 (2005) - 2003
- [j33]Bostjan Bresar, Wilfried Imrich, Sandi Klavzar:
Fast recognition algorithms for classes of partial cubes. Discret. Appl. Math. 131(1): 51-61 (2003) - [j32]Bostjan Bresar, Wilfried Imrich, Sandi Klavzar:
Tree-like isometric subgraphs of hypercubes. Discuss. Math. Graph Theory 23(2): 227-240 (2003) - [j31]Wilfried Imrich, Blaz Zmazek, Janez Zerovnik:
Weak k-reconstruction of Cartesian products. Discuss. Math. Graph Theory 23(2): 273-285 (2003) - [j30]Wilfried Imrich, Riste Skrekovski:
A theorem on integer flows on cartesian products of graphs. J. Graph Theory 43(2): 93-98 (2003) - 2002
- [j29]Wilfried Imrich, Peter F. Stadler:
Minimum cycle bases of product graphs. Australas. J Comb. 26: 233-244 (2002) - [j28]Bostjan Bresar, Wilfried Imrich, Sandi Klavzar, Henry Martyn Mulder, Riste Skrekovski:
Tiled partial cubes. J. Graph Theory 40(2): 91-103 (2002) - 2001
- [j27]Wilfried Imrich, Blaz Zniazek, Janez Zerovnik:
Weak k-reconstruction of cartesian product graphs. Electron. Notes Discret. Math. 10: 297-300 (2001) - [j26]Ervin Györi, Wilfried Imrich:
On the Strong Product of a k-Extendable and an l-Extendable Graph. Graphs Comb. 17(2): 245-253 (2001)
1990 – 1999
- 1999
- [j25]Wilfried Imrich, Sandi Klavzar:
Recognizing Graphs of Acyclic Cubical Complexes. Discret. Appl. Math. 95(1-3): 321-330 (1999) - [j24]Wilfried Imrich, Sandi Klavzar, Henry Martyn Mulder:
Median Graphs and Triangle-Free Graphs. SIAM J. Discret. Math. 12(1): 111-118 (1999) - [j23]Johann Hagauer, Wilfried Imrich, Sandi Klavzar:
Recognizing Median Graphs in Subquadratic Time. Theor. Comput. Sci. 215(1-2): 123-136 (1999) - 1998
- [j22]Wilfried Imrich, Sandi Klavzar, Aleksander Vesel:
A characterization of halved cubes. Ars Comb. 48 (1998) - [j21]Wilfried Imrich:
Factoring cardinal product graphs in polynomial time. Discret. Math. 192(1-3): 119-144 (1998) - [j20]Wilfried Imrich, Sandi Klavzar:
A Convexity Lemma and Expansion Procedures for Bipartite Graphs. Eur. J. Comb. 19(6): 677-685 (1998) - 1997
- [j19]Wilfried Imrich, Tomaz Pisanski, Janez Zerovnik:
Recognizing Cartesian graph bundles. Discret. Math. 167-168: 393-403 (1997) - [j18]Wilfried Imrich, Sandi Klavzar:
Recognizing Hamming Graphs in Linear Time and space. Inf. Process. Lett. 63(2): 91-95 (1997) - 1996
- [j17]Wilfried Imrich, Janez Zerovnik:
On the weak reconstruction of Cartesian-product graphs. Discret. Math. 150(1-3): 167-178 (1996) - [j16]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) - [j15]C. Paul Bonnington, Wilfried Imrich, Norbert Seifter:
Geodesics in Transitive Graphs. J. Comb. Theory B 67(1): 12-33 (1996) - 1995
- [j14]C. Paul Bonnington, Wilfried Imrich, Mark E. Watkins:
Separating double rays in locally finite planar graphs. Discret. Math. 145(1-3): 61-72 (1995) - [j13]Wilfried Imrich, Sandi Klavzar, Aleksander Vesel:
Recognizing halved cubes in a constant time per edge. Eur. J. Comb. 16(6): 617-621 (1995) - 1992
- [j12]Franz Aurenhammer, Johann Hagauer, Wilfried Imrich:
Cartesian Graph Factorization at Logarithmic Cost per Edge. Comput. Complex. 2: 331-349 (1992) - [j11]Wilfried Imrich, Jaroslav Nesetril:
Simple tournaments and sharply transitive groups. Discret. Math. 108(1-3): 159-165 (1992) - [j10]Wilfried Imrich, Sandi Klavzar:
Retracts of strong products of graphs. Discret. Math. 109(1-3): 147-154 (1992) - 1991
- [j9]Wilfried Imrich, Norbert Seifter:
A survey on graphs with polynomial growth. Discret. Math. 95(1-3): 101-117 (1991) - 1990
- [j8]Wilfried Imrich, Gert Sabidussi:
Focality and graph isomorphism. Discret. Math. 81(3): 237-245 (1990) - [c1]Franz Aurenhammer, Johann Hagauer, Wilfried Imrich:
Factoring Cartesian-Product Graphs at Logarithmic Cost per Edge. IPCO 1990: 29-44
1980 – 1989
- 1989
- [j7]Wilfried Imrich, Norbert Seifter:
A note on the growth of transitive graphs. Discret. Math. 73(1-2): 111-117 (1989) - [j6]Chris D. Godsil, Wilfried Imrich, Norbert Seifter, Mark E. Watkins, Wolfgang Woess:
A note on bounded automorphisms of infinite graphs. Graphs Comb. 5(1): 333-338 (1989) - 1987
- [j5]Chris D. Godsil, Wilfried Imrich:
Embedding graphs in Cayley graphs. Graphs Comb. 3(1): 39-43 (1987) - 1984
- [j4]Wilfried Imrich:
Explicit construction of regular graphs without small cycles. Comb. 4(1): 53-59 (1984) - [j3]Wilfried Imrich, J. M. S. Simões-Pereira, Christina Zamfirescu:
On optimal embeddings of metrics in graphs. J. Comb. Theory B 36(1): 1-15 (1984)
1970 – 1979
- 1979
- [j2]Wilfried Imrich:
On the connectivity of cayley graphs. J. Comb. Theory B 26(3): 323-326 (1979) - 1973
- [j1]László Babai, Wilfried Imrich:
On groups of polyhedral graphs. Discret. Math. 5(1): 101-103 (1973)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
