Chair of Applied Mathematics (170)
Organisational unit: Chair
Research output
- Published
Reachability relations, transitive digraphs and groups
Seifter, N., Potocnik, P., Malnic, A. & Sparl, P., 2015, In: Ars mathematica contemporanea. 8.2015, 1, p. 83-94 12 p.Research output: Contribution to journal › Article › Research › peer-review
- Published
Recognizing Cartesian graph bundles
Imrich, W., Pisanski, T. & Žerovnik, J., 15 Apr 1997, In: Discrete mathematics. 167-168, p. 393-403 11 p.Research output: Contribution to journal › Article › Research › peer-review
- Published
Recognizing Cartesian products in linear time
Imrich, W. & Peterin, I., 2007, In: Discrete mathematics. 307, p. 472-483Research output: Contribution to journal › Article › Research › peer-review
- Published
Recognizing Cartesian products in linear time
Imrich, W. & Peterin, I., 2006, 5th Slow. Int. Conference on Graph Theory. p. 000-000Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
- Published
Recognizing generalized Sierpiński graphs
Imrich, W. & Peterin, I., 1 Apr 2020, In: Applicable analysis and discrete mathematics. 14.2020, 1, p. 122-137 16 p.Research output: Contribution to journal › Article › Research › peer-review
- Published
Recognizing graphs of acyclic cubical complexes
Imrich, W. & Klavžar, S., 30 Jul 1999, In: Discrete applied mathematics. 95, 1-3, p. 321-330 10 p.Research output: Contribution to journal › Conference article › peer-review
- Published
Recognizing halved cubes in a constant time per edge
Imrich, W., Klavẑar, S. & Vesel, A., Nov 1995, In: European journal of combinatorics . 16, 6, p. 617-621 5 p.Research output: Contribution to journal › Article › Research › peer-review
- Published
Recognizing Hamming graphs in linear time and space
Imrich, W. & Klavžr, S., 28 Jul 1997, In: Information processing letters. 63, 2, p. 91-95 5 p.Research output: Contribution to journal › Article › Research › peer-review
- Published
Recognizing median graphs in subquadratic time
Hagauer, J., Imrich, W. & Klavžar, S., 28 Feb 1999, In: Theoretical Computer Science. 215, 1-2, p. 123-136 14 p.Research output: Contribution to journal › Article › Research › peer-review
- Published
Reconstructing subgraph-counting graph polynomials of increasing families of graphs
Imrich, W., Bresar, B. & Klavzar, S., 2005, In: Discrete mathematics. 297, p. 159-166Research output: Contribution to journal › Article › Research › peer-review
