European journal of combinatorics, ‎0195-6698

Journal

ISSNs0195-6698
11 - 20 out of 23Page size: 10
Sort by: Title

Research output

  1. Published

    Endomorphism Breaking in Graphs

    Imrich, W., Kalinowski, R., Lehner, F. & Pilsniak, M., 2014, In: European journal of combinatorics. 21, p. 1-16

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

  2. 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

  3. 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

  4. Published

    Highly arc transitive digraphs: reachability, topologoical groups

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

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

  5. Published

    Infinite arc-transitive and highly-arc-transitive digraphs

    Möller, R. G., Potočnik, P. & Seifter, N., 4 Dec 2018, In: European journal of combinatorics. 77.2019, March, p. 78-89 12 p.

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

  6. Published

    Lattice embeddings of trees

    Imrich, W. & Kovse, M., 2009, In: European journal of combinatorics. 5, p. 1142-1148

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

  7. Published

    Multiple Kronecker Covering Graphs

    Imrich, W., 2008, In: European journal of combinatorics. 29, p. 1116-1122

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

  8. Published

    On the action of nilpotent and metabelian groups on infinite, locally finite graphs

    Seifter, N., 1989, In: European journal of combinatorics .

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

  9. 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

  10. 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 journal › Article › Research › peer-review

Previous 1 2 3 Next
View graph of relations