| Distinguishing graphs by edge-colourings R Kalinowski, M Pil¶niak European Journal of Combinatorics 45, 124-131, 2015 | 82 | 2015 |
| Minimum number of palettes in edge colorings M Horņįk, R Kalinowski, M Meszka, M Wo¼niak Graphs and Combinatorics 30 (3), 619-626, 2014 | 29 | 2014 |
| A catalogue of small maximal nonhamiltonian graphs J Jamrozik, R Kalinowski, Z Skupień Discrete Mathematics 39 (2), 229-234, 1982 | 25 | 1982 |
| Arbitrarily vertex decomposable suns with few rays R Kalinowski, M Pil¶niak, M Wo¼niak, I Zio³o Discrete mathematics 309 (11), 3726-3732, 2009 | 19 | 2009 |
| The distinguishing index of the Cartesian product of finite graphs. A Gorzkowska, R Kalinowski, M Pilsniak Ars Math. Contemp. 12 (1), 77-87, 2017 | 18 | 2017 |
| Distinguishing Cartesian products of countable graphs E Estaji, W Imrich, R Kalinowski, M Pil¶niak, T Tucker Discussiones Mathematicae Graph Theory 37 (1), 155-164, 2017 | 17 | 2017 |
| Dense arbitrarily partitionable graphs R Kalinowski, M Pil¶niak, I Schiermeyer, M Wo¼niak Discussiones Mathematicae Graph Theory 36 (1), 5-22, 2016 | 14 | 2016 |
| Distinguishing graphs by total colourings R Kalinowski, M Pil¶niak, M Wo¼niak Ars Mathematica Contemporanea 11 (1), 79-89, 2015 | 13 | 2015 |
| Periodic points of continuous mappings of trees W Imrich, R Kalinowski North-Holland Mathematics Studies 115, 447-460, 1985 | 13 | 1985 |
| Endomorphism breaking in graphs W Imrich, R Kalinowski, F Lehner, M Pil¶niak arXiv preprint arXiv:1311.6972, 2013 | 12 | 2013 |
| On-line arbitrarily vertex decomposable suns R Kalinowski, M Pil¶niak, M Wo¼niak, IA Zio³o Discrete Mathematics 309 (22), 6328-6336, 2009 | 12 | 2009 |
| J. Przyby lo and M. Wozniak O Baudon, J Bensmail, R Kalinowski, A Marczyk On the structure of arbitrarily partitionable graphs with given connectivity …, 2015 | 11 | 2015 |
| Bounds for distinguishing invariants of infinite graphs W Imrich, R Kalinowski, M Pil¶niak, MH Shekarriz arXiv preprint arXiv:1910.12107, 2019 | 10 | 2019 |
| On the Cartesian product of of an arbitrarily partitionable graph and a traceable graph O Baudon, J Bensmail, R Kalinowski, A Marczyk, J Przyby³o, M Wozniak Discrete Mathematics & Theoretical Computer Science 16 (Graph Theory), 2014 | 10 | 2014 |
| The distinguishing index of connected graphs without pendant edges W Imrich, R Kalinowski, M Pil¶niak, M Wo¼niak Ars mathematica contemporanea 18 (1), 117-126, 2020 | 9 | 2020 |
| Large isaacs' graphs are maximally non-Hamilton-connected R Kalinowski, Z Skupień Discrete mathematics 82 (1), 101-104, 1990 | 8 | 1990 |
| Distinguishing arc-colourings of symmetric digraphs. R Kalinowski, M Pilsniak, M Prorok Art Discret. Appl. Math. 6 (2), 2, 2022 | 5 | 2022 |
| Dense on-line arbitrarily partitionable graphs R Kalinowski Discrete Applied Mathematics 226, 71-77, 2017 | 5 | 2017 |
| How to personalize the vertices of a graph? R Kalinowski, M Pil¶niak, J Przyby³o, M Wo¼niak European Journal of Combinatorics 40, 116-123, 2014 | 5 | 2014 |
| Edge colorings and the number of palettes M Hornįk, R Kalinowski, M Meszka, M Wozniak Graphs Combin 30, 619-626, 2014 | 5 | 2014 |
