Research output

71 - 80 out of 164Page size: 10

Sort by: Publication date

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-166
Research 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
Highly arc-transitive digraphs with no homomorphism onto $\Bbb Z$
Seifter, N., Malnic, A., Marusic, D. & Boris, Z., 2002, In: Combinatorica.
Research output: Contribution to journal › Article › Research › peer-review
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
Finite contractions of graphs with polynomial growth
Seifter, N. & Lukacs, A., 2001, In: European journal of combinatorics .
Research output: Contribution to journal › Article › Research › peer-review
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
$k$-dominating sets of cardinal products of paths
Seifter, N. & Klobucar, A., 2000, In: European journal of combinatorics .
Research output: Contribution to journal › Article › Research › peer-review
Published
Approximating graphs with polynomial growth
Seifter, N. & Woess, W., 2000, In: Glasgow mathematical journal.
Research output: Contribution to journal › Article › Research › peer-review

Previous 1...4 5 6 7 8 9 10 11 ...17 Next

Research Portal

Research output

Reconstructing subgraph-counting graph polynomials of increasing families of graphs

Fast recognition algorithms for classes of partial cubes

A theorem on integer flows on Cartesian products of graphs

Highly arc-transitive digraphs with no homomorphism onto $\Bbb Z$

Minimum cycle bases of product graphs

Finite contractions of graphs with polynomial growth

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

Weak k-reconstruction of cartesian product graphs

$k$-dominating sets of cardinal products of paths

Approximating graphs with polynomial growth

Advanced filters