European journal of combinatorics, 0195-6698
Journal
ISSNs | 0195-6698 |
---|
Research output
- 2008
- Published
Reachability relations in digraphs
Seifter, N., Malnic, A., Marusic, D., Boris, Z. & Sparl, P., 2008, In: European journal of combinatorics. 29, p. 1566-1581Research output: Contribution to journal › Article › Research › peer-review
- Published
The distinguishing number of Cartesian products of complete graphs
Imrich, W., 2008, In: European journal of combinatorics. 29, p. 922-929Research output: Contribution to journal › Article › Research › peer-review
- 2005
- Published
Highly arc transitive digraphs: reachability, topological groups
Seifter, N., Möller, R. G., Malnic, A., Marusic, D., Boris, Z. & Trofimov, V. I., 2005, In: European journal of combinatorics .Research output: Contribution to journal › Article › Research › peer-review
- Published
Highly arc transitive digraphs: reachability, topologoical groups
Seifter, N., 2005, In: European journal of combinatorics. 26, p. 19-28Research 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
- 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
- 1999
- Published
Constructing infinite one-regular graphs
Seifter, N., Malnic, A. & Marusic, D., 1999, In: European journal of combinatorics .Research output: Contribution to journal › Article › Research › peer-review
- 1998
- 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
- Published
Digraphical regular representations of infinite finitely generated groups
Seifter, N. & Möller, R. G., 1998, In: European journal of combinatorics .Research output: Contribution to journal › Article › Research › peer-review
- 1996
- 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