The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Wilfried Imrich: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  31. Distinguishing Infinite Graphs. [Citation Graph (, )][DBLP]


  32. On the remoteness function in median graphs. [Citation Graph (, )][DBLP]


  33. Multiple Kronecker covering graphs. [Citation Graph (, )][DBLP]


  34. The distinguishing number of Cartesian products of complete graphs. [Citation Graph (, )][DBLP]


  35. Approximate graph products. [Citation Graph (, )][DBLP]


  36. Lattice embeddings of trees. [Citation Graph (, )][DBLP]


Search in 0.116secs, Finished in 0.119secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002