Wilfried Imrich

61 - 80 out of 125Page size: 20

Research output

  1. 2005
  2. Published

    Hypercubes as direct products

    Imrich, W., Bresar, B., Klavzar, S. & Zmazek, B., 2005, In: SIAM journal on discrete mathematics. 18, p. 779-786

    Research output: Contribution to journal › Article › Research › peer-review

  3. Published

    Reconstructing subgraph-counting graph polynomials of increasing families of graphs

    Imrich, W., Bresar, B. & Klavzar, S., 2005, In: Discrete mathematics. 297, p. 159-166

    Research output: Contribution to journal › Article › Research › peer-review

  4. 2003
  5. Published

    Fast recognition algorithms for classes of partial cubes

    Brešar, B., Imrich, W. & Klavžar, S., 6 Sept 2003, In: Discrete applied mathematics. 131, 1, p. 51-61 11 p.

    Research output: Contribution to journal › Conference article › peer-review

  6. Published

    A theorem on integer flows on Cartesian products of graphs

    Imrich, W. & Škrekovski, R., Jun 2003, In: Journal of graph theory. 43, 2, p. 93-98 6 p.

    Research output: Contribution to journal › Article › Research › peer-review

  7. 2002
  8. Published

    Minimum cycle bases of product graphs

    Imrich, W. & Stadler, P. F., 2002, In: Australasian journal of combinatorics. 26, p. 233-244 12 p.

    Research output: Contribution to journal › Article › Research › peer-review

  9. 2001
  10. Published

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

    Gyori, E. & Imrich, W., 2001, In: Graphs and combinatorics . 17, 2, p. 245-253 9 p.

    Research output: Contribution to journal › Article › Research › peer-review

  11. Published

    Weak k-reconstruction of cartesian product graphs

    Imrich, W., Zmazek, B. & Žerovnik, J., 2001, In: Electronic notes in discrete mathematics. 10, p. 297-300 4 p.

    Research output: Contribution to journal › Article › Research › peer-review

  12. 2000
  13. Published

    Product Graphs

    Imrich, W. & Klavzar, S., 2000

    Research output: Book/Report › Book › Research

  14. 1999
  15. Published

    Recognizing graphs of acyclic cubical complexes

    Imrich, W. & Klavžar, S., 30 Jul 1999, In: Discrete applied mathematics. 95, 1-3, p. 321-330 10 p.

    Research output: Contribution to journal › Conference article › peer-review

  16. Published

    Recognizing median graphs in subquadratic time

    Hagauer, J., Imrich, W. & Klavžar, S., 28 Feb 1999, In: Theoretical Computer Science. 215, 1-2, p. 123-136 14 p.

    Research output: Contribution to journal › Article › Research › peer-review

  17. Published

    Median graphs and triangle-free graphs

    Imrich, W., Klavžar, S. & Mulder, H. M., 1999, In: SIAM journal on discrete mathematics. 12, 1, p. 111-118 8 p.

    Research output: Contribution to journal › Article › Research › peer-review

  18. 1998
  19. Published

    Factoring cardinal product graphs in polynomial time

    Imrich, W., 28 Oct 1998, In: Discrete mathematics. 192, 1-3, p. 119-144 26 p.

    Research output: Contribution to journal › Article › Research › peer-review

  20. Published

    A convexity lemma and expansion procedures for bipartite graphs

    Imrich, W. & Klavžar, S., Aug 1998, In: European journal of combinatorics . 19, 6, p. 677-685 9 p.

    Research output: Contribution to journal › Article › Research › peer-review

  21. Published

    A characterization of halved cubes

    Imrich, W., Klavžar, S. & Vesel, A., Apr 1998, In: Ars combinatoria. 48, p. 27-32 6 p.

    Research output: Contribution to journal › Article › Research › peer-review

  22. 1997
  23. Published

    Recognizing Hamming graphs in linear time and space

    Imrich, W. & Klavžr, S., 28 Jul 1997, In: Information processing letters. 63, 2, p. 91-95 5 p.

    Research output: Contribution to journal › Article › Research › peer-review

  24. Published

    Recognizing Cartesian graph bundles

    Imrich, W., Pisanski, T. & Žerovnik, J., 15 Apr 1997, In: Discrete mathematics. 167-168, p. 393-403 11 p.

    Research output: Contribution to journal › Article › Research › peer-review

  25. 1996
  26. Published

    On the weak reconstruction of Cartesian-product graphs

    Imrich, W. & Žerovnik, J., 6 Apr 1996, In: Discrete mathematics. 150, 1-3, p. 167-178 12 p.

    Research output: Contribution to journal › Article › Research › peer-review

  27. Published

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

    Imrich, W. & Klavžar, S., Feb 1996, In: European journal of combinatorics . 17, 2-3, p. 209-221 13 p.

    Research output: Contribution to journal › Article › Research › peer-review

  28. Published

    Geodesics in transitive graphs

    Seifter, N., Imrich, W. & Bonnington, P., 1996, In: Journal of combinatorial theory. Series B.

    Research output: Contribution to journal › Article › Research › peer-review

  29. 1995
  30. Published

    Recognizing halved cubes in a constant time per edge

    Imrich, W., Klavẑar, S. & Vesel, A., Nov 1995, In: European journal of combinatorics . 16, 6, p. 617-621 5 p.

    Research output: Contribution to journal › Article › Research › peer-review

Previous 1 2 3 4 5 6 7 Next
View graph of relations

Contact

Phone: 1717

Latest Research Output

View more (125)