Follow
Rafal Kalinowski
Rafal Kalinowski
AGH University, Cracow, Poland
Verified email at agh.edu.pl
Title
Cited by
Cited by
Year
Distinguishing graphs by edge-colourings
R Kalinowski, M Pilśniak
European Journal of Combinatorics 45, 124-131, 2015
832015
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
292014
A catalogue of small maximal nonhamiltonian graphs
J Jamrozik, R Kalinowski, Z Skupień
Discrete Mathematics 39 (2), 229-234, 1982
251982
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
192009
The distinguishing index of the Cartesian product of finite graphs.
A Gorzkowska, R Kalinowski, M Pilsniak
Ars Math. Contemp. 12 (1), 77-87, 2017
182017
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
172017
Distinguishing graphs by total colourings
R Kalinowski, M Pilśniak, M Woźniak
Ars Mathematica Contemporanea 11 (1), 79-89, 2015
132015
Periodic points of continuous mappings of trees
W Imrich, R Kalinowski
North-Holland Mathematics Studies 115, 447-460, 1985
131985
Dense arbitrarily partitionable graphs
R Kalinowski, M Pilśniak, I Schiermeyer, M Woźniak
Discussiones Mathematicae Graph Theory 36 (1), 5-22, 2016
122016
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
122015
Endomorphism breaking in graphs
W Imrich, R Kalinowski, F Lehner, M Pilśniak
arXiv preprint arXiv:1311.6972, 2013
122013
On-line arbitrarily vertex decomposable suns
R Kalinowski, M Pilśniak, M Woźniak, IA Zioło
Discrete Mathematics 309 (22), 6328-6336, 2009
122009
Bounds for distinguishing invariants of infinite graphs
W Imrich, R Kalinowski, M Pilśniak, MH Shekarriz
arXiv preprint arXiv:1910.12107, 2019
112019
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
112014
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
92020
Large isaacs' graphs are maximally non-Hamilton-connected
R Kalinowski, Z Skupień
Discrete mathematics 82 (1), 101-104, 1990
81990
Distinguishing arc-colourings of symmetric digraphs.
R Kalinowski, M Pilsniak, M Prorok
Art Discret. Appl. Math. 6 (2), 2, 2022
62022
Dense on-line arbitrarily partitionable graphs
R Kalinowski
Discrete Applied Mathematics 226, 71-77, 2017
52017
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
52014
Edge colorings and the number of palettes
M Hornák, R Kalinowski, M Meszka, M Wozniak
Graphs Combin 30, 619-626, 2014
52014
The system can't perform the operation now. Try again later.
Articles 1–20