| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Pavol Hell, Wilfried Imrich, Jaroslav Nesetril |
Preface.  |
Discrete Mathematics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Wilfried Imrich, Sandi Klavzar |
Two-ended regular median graphs. |
Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Wilfried Imrich, Werner Klöckl |
Factoring directed graphs with respect to the cardinal product in polynomial time II. |
Discussiones Mathematicae Graph Theory |
2010 |
DBLP BibTeX RDF |
|
| 1 | Wilfried Imrich, Iztok Peterin, Simon Spacapan, Cun-Quan Zhang |
NZ-flows in strong products of graphs. |
Journal of Graph Theory |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Wilfried Imrich, Matjaz Kovse |
Lattice embeddings of trees. |
Eur. J. Comb. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Hellmuth, Wilfried Imrich, Werner Klöckl, Peter F. Stadler |
Approximate graph products. |
Eur. J. Comb. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Wilfried Imrich, Sandi Klavzar |
Transitive, Locally Finite Median Graphs with Finite Blocks. |
Graphs and Combinatorics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Hellmuth, Wilfried Imrich, Werner Klöckl, Peter F. Stadler |
Local Algorithms for the Prime Factorization of Strong Product Graphs. |
Mathematics in Computer Science |
2009 |
DBLP BibTeX RDF |
|
| 1 | 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 |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Wilfried Imrich, Tomaz Pisanski |
Multiple Kronecker covering graphs. |
Eur. J. Comb. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Wilfried Imrich, Janja Jerebic, Sandi Klavzar |
The distinguishing number of Cartesian products of complete graphs. |
Eur. J. Comb. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Wilfried Imrich, Alenka Lipovec, Iztok Peterin, Petra Zigert |
Fast recognition of classes of almost-median graphs. |
Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Wilfried Imrich, Iztok Peterin |
Recognizing Cartesian products in linear time. |
Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Wilfried Imrich, Sandi Klavzar, Vladimir Ivanovich Trofimov |
Distinguishing Infinite Graphs. |
Electr. J. Comb. |
2007 |
DBLP BibTeX RDF |
|
| 1 | Wilfried Imrich, Werner Klöckl |
Factoring directed graphs with respect to the cardinal product in polynomial time. |
Discussiones Mathematicae Graph Theory |
2007 |
DBLP BibTeX RDF |
|
| 1 | Wilfried Imrich, Sandi Klavzar, Douglas F. Rall |
Cancellation properties of products of graphs. |
Discrete Applied Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Wilfried Imrich, Peter F. Stadler |
A prime factor theorem for a generalized direct product. |
Discussiones Mathematicae Graph Theory |
2006 |
DBLP BibTeX RDF |
|
| 1 | Wilfried Imrich, Sandi Klavzar |
Distinguishing Cartesian powers of graphs. |
Journal of Graph Theory |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Bostjan Bresar, Wilfried Imrich, Sandi Klavzar |
Reconstructing subgraph-counting graph polynomials of increasing families of graphs. |
Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Bostjan Bresar, Wilfried Imrich, Sandi Klavzar, Blaz Zmazek |
Hypercubes As Direct Products. |
SIAM J. Discrete Math. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Bostjan Bresar, Wilfried Imrich, Sandi Klavzar |
Fast recognition algorithms for classes of partial cubes. |
Discrete Applied Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Wilfried Imrich, Blaz Zniazek, Janez Zerovnik |
Weak k-reconstruction of cartesian product graphs. |
Electronic Notes in Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Ervin Györi, Wilfried Imrich |
On the Strong Product of a k-Extendable and an l-Extendable Graph. |
Graphs and Combinatorics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Johann Hagauer, Wilfried Imrich, Sandi Klavzar |
Recognizing Median Graphs in Subquadratic Time. |
Theor. Comput. Sci. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Wilfried Imrich, Sandi Klavzar, Henry Martyn Mulder |
Median Graphs and Triangle-Free Graphs. |
SIAM J. Discrete Math. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Wilfried Imrich, Sandi Klavzar |
Recognizing Graphs of Acyclic Cubical Complexes. |
Discrete Applied Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Wilfried Imrich |
Factoring cardinal product graphs in polynomial time. |
Discrete Mathematics |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Wilfried Imrich, Sandi Klavzar |
A Convexity Lemma and Expansion Procedures for Bipartite Graphs. |
Eur. J. Comb. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Wilfried Imrich, Sandi Klavzar, Aleksander Vesel |
A characterization of halved cubes. |
Ars Comb. |
1998 |
DBLP BibTeX RDF |
|
| 1 | Wilfried Imrich, Sandi Klavzar |
Recognizing Hamming Graphs in Linear Time and space. |
Inf. Process. Lett. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Wilfried Imrich, Tomaz Pisanski, Janez Zerovnik |
Recognizing Cartesian graph bundles. |
Discrete Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | C. Paul Bonnington, Wilfried Imrich, Norbert Seifter |
Geodesics in Transitive Graphs. |
J. Comb. Theory, Ser. B |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Wilfried Imrich, Janez Zerovnik |
On the weak reconstruction of Cartesian-product graphs. |
Discrete Mathematics |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Wilfried Imrich, Sandi Klavzar |
On the Complexity of Recognizing Hamming Graphs and Related Classes of Graphs. |
Eur. J. Comb. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | C. Paul Bonnington, Wilfried Imrich, Mark E. Watkins |
Separating double rays in locally finite planar graphs. |
Discrete Mathematics |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Wilfried Imrich, Jaroslav Nesetril |
Simple tournaments and sharply transitive groups. |
Discrete Mathematics |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Wilfried Imrich, Sandi Klavzar |
Retracts of strong products of graphs. |
Discrete Mathematics |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Franz Aurenhammer, Johann Hagauer, Wilfried Imrich |
Cartesian Graph Factorization at Logarithmic Cost per Edge. |
Computational Complexity |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Wilfried Imrich, Norbert Seifter |
A survey on graphs with polynomial growth. |
Discrete Mathematics |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Wilfried Imrich, Gert Sabidussi |
Focality and graph isomorphism. |
Discrete Mathematics |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Franz Aurenhammer, Johann Hagauer, Wilfried Imrich |
Factoring Cartesian-Product Graphs at Logarithmic Cost per Edge. |
IPCO |
1990 |
DBLP BibTeX RDF |
|
| 1 | Wilfried Imrich, Norbert Seifter |
A note on the growth of transitive graphs. |
Discrete Mathematics |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Chris D. Godsil, Wilfried Imrich, Norbert Seifter, Mark E. Watkins, Wolfgang Woess |
A note on bounded automorphisms of infinite graphs. |
Graphs and Combinatorics |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Chris D. Godsil, Wilfried Imrich |
Embedding graphs in Cayley graphs. |
Graphs and Combinatorics |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Wilfried Imrich, J. M. S. Simões-Pereira, Christina Zamfirescu |
On optimal embeddings of metrics in graphs. |
J. Comb. Theory, Ser. B |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Wilfried Imrich |
Explicit construction of regular graphs without small cycles. |
Combinatorica |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Wilfried Imrich |
On the connectivity of cayley graphs. |
J. Comb. Theory, Ser. B |
1979 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")