Wilfried Imrich
Research output
- 2005
- Published
Reconstructing subgraph-counting graph polynomials of increasing families of graphs
Imrich, W., Bresar, B. & Klavzar, S., 2005, In: Discrete mathematics. 297, p. 159-166Research output: Contribution to journal › Article › Research › peer-review
- 2003
- 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
- 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
- 2002
- 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
- 2001
- 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
- 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
- 2000
- Published
- 1999
- 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
- 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
- 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