Discrete mathematics, 0012-365X

Journal

ISSNs0012-365X

Research output

  1. 2019
  2. Published

    Sharply k-arc-transitive-digraphs: Finite and infinite examples

    Möller, R. G., Potočnik, P. & Seifter, N. 1 Mar 2019 In : Discrete mathematics. 342, 3, p. 768-776 9 p.

    Research output: Contribution to journalArticleResearchpeer-review

  3. 2018
  4. Published

    Cartesian products of directed graphs with loops

    Imrich, W. & Peterin, I. 2 May 2018 In : Discrete mathematics. 2018, 341, no. 5, p. 1336 - 1343 8 p.

    Research output: Contribution to journalArticleResearchpeer-review

  5. 2012
  6. Published

    Algebraic graph theory - a volume dedicated to Gert Sabidussi on the occasion of his 80th birthday

    Imrich, W., Hell, P. & Nesetril, J. 2012 In : Discrete mathematics. 312, p. 5-6

    Research output: Contribution to journalArticleResearchpeer-review

  7. Published

    Rocognizing triangulated Cartesian graph products

    Brand, C. & Afzal, S. 2012 In : Discrete mathematics. 312, p. 188-193

    Research output: Contribution to journalArticleResearchpeer-review

  8. 2011
  9. Published

    Two-ended regular median graphs

    Imrich, W. & Klavzar, S. 2011 In : Discrete mathematics. 311, p. 1418-1422

    Research output: Contribution to journalArticleResearchpeer-review

  10. 2008
  11. Published

    Transitive digraphs with more than one end

    Seifter, N. 2008 In : Discrete mathematics. 308, p. 1531-1537

    Research output: Contribution to journalArticleResearchpeer-review

  12. 2007
  13. Published

    Fast recognition of classes of almost-median grapphs

    Imrich, W., Lipovec, A., Peterin, I. & Zigert, P. 2007 In : Discrete mathematics. 307, p. 464-471

    Research output: Contribution to journalArticleResearchpeer-review

  14. Published

    Recognizing Cartesian products in linear time

    Imrich, W. & Peterin, I. 2007 In : Discrete mathematics. 307, p. 472-483

    Research output: Contribution to journalArticleResearchpeer-review

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