European journal of combinatorics, ‎0195-6698

Journal

ISSNs0195-6698

Research output

  1. 2008
  2. Published

    Reachability relations in digraphs

    Seifter, N., Malnic, A., Marusic, D., Boris, Z. & Sparl, P., 2008, In: European journal of combinatorics. 29, p. 1566-1581

    Research output: Contribution to journalArticleResearchpeer-review

  3. Published

    The distinguishing number of Cartesian products of complete graphs

    Imrich, W., 2008, In: European journal of combinatorics. 29, p. 922-929

    Research output: Contribution to journalArticleResearchpeer-review

  4. 2005
  5. 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 journalArticleResearchpeer-review

  6. Published

    Highly arc transitive digraphs: reachability, topologoical groups

    Seifter, N., 2005, In: European journal of combinatorics. 26, p. 19-28

    Research output: Contribution to journalArticleResearchpeer-review

  7. 2001
  8. Published

    Finite contractions of graphs with polynomial growth

    Seifter, N. & Lukacs, A., 2001, In: European journal of combinatorics .

    Research output: Contribution to journalArticleResearchpeer-review

  9. 2000
  10. Published

    $k$-dominating sets of cardinal products of paths

    Seifter, N. & Klobucar, A., 2000, In: European journal of combinatorics .

    Research output: Contribution to journalArticleResearchpeer-review

  11. 1999
  12. Published

    Constructing infinite one-regular graphs

    Seifter, N., Malnic, A. & Marusic, D., 1999, In: European journal of combinatorics .

    Research output: Contribution to journalArticleResearchpeer-review

  13. 1998
  14. 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 journalArticleResearchpeer-review

  15. 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 journalArticleResearchpeer-review

  16. 1996
  17. 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 journalArticleResearchpeer-review