default search action
Rafal Kalinowski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j34]Felix Bock, Rafal Kalinowski
, Johannes Pardey, Monika Pilsniak
Majority Edge-Colorings of Graphs. Electron. J. Comb. 30(1) (2023) - 2022
- [j33]Rafal Kalinowski
Distinguishing arc-colourings of symmetric digraphs. Art Discret. Appl. Math. 6(2): 2 (2022) - [j32]Rafal Kalinowski
Proper distinguishing arc-colourings of symmetric digraphs. Appl. Math. Comput. 421: 126939 (2022) - [j31]Rafal Kalinowski
Extremal graphs for the distinguishing index. Discret. Math. 345(8): 112905 (2022) - 2021
- [j30]Wilfried Imrich
On Asymmetric Colourings of Claw-Free Graphs. Electron. J. Comb. 28(3): 3 (2021) - 2020
- [j29]Wilfried Imrich
The distinguishing index of connected graphs without pendant edges. Ars Math. Contemp. 18(1): 117-126 (2020)
2010 – 2019
- 2019
- [j28]Izak Broere, Wilfried Imrich
Asymmetric colorings of products of graphs and digraphs. Discret. Appl. Math. 266: 56-64 (2019) - 2017
- [j27]Aleksandra Gorzkowska
The distinguishing index of the Cartesian product of finite graphs. Ars Math. Contemp. 12(1): 77-87 (2017) - [j26]Wilfried Imrich
Bounds for Distinguishing Invariants of Infinite Graphs. Electron. J. Comb. 24(3): 3 (2017) - [j25]Rafal Kalinowski
Dense on-line arbitrarily partitionable graphs. Discret. Appl. Math. 226: 71-77 (2017) - [j24]Rafal Kalinowski
A note on breaking small automorphisms in graphs. Discret. Appl. Math. 232: 221-225 (2017) - [j23]Ehsan Estaji, Wilfried Imrich
Distinguishing Cartesian products of countable graphs. Discuss. Math. Graph Theory 37(1): 155-164 (2017) - 2016
- [j22]Rafal Kalinowski, Monika Pilsniak, Mariusz Wozniak:
Distinguishing graphs by total colourings. Ars Math. Contemp. 11(1): 79-89 (2016) - [j21]Rafal Kalinowski, Monika Pilsniak, Mariusz Wozniak:
Preface. Discret. Math. 339(7): 1827 (2016) - [j20]Rafal Kalinowski, Monika Pilsniak, Ingo Schiermeyer, Mariusz Wozniak:
Dense arbitrarily partitionable graphs. Discuss. Math. Graph Theory 36(1): 5-22 (2016) - 2015
- [j19]Rafal Kalinowski, Monika Pilsniak:
Distinguishing graphs by edge-colourings. Eur. J. Comb. 45: 124-131 (2015) - 2014
- [j18]Wilfried Imrich, Rafal Kalinowski, Florian Lehner
Endomorphism Breaking in Graphs. Electron. J. Comb. 21(1): 1 (2014) - [j17]Olivier Baudon, Julien Bensmail, Rafal Kalinowski, Antoni Marczyk, Jakub Przybylo, Mariusz Wozniak:
On the Cartesian product of of an arbitrarily partitionable graph and a traceable graph. Discret. Math. Theor. Comput. Sci. 16(1): 225-232 (2014) - [j16]Rafal Kalinowski, Monika Pilsniak, Jakub Przybylo, Mariusz Wozniak:
How to personalize the vertices of a graph? Eur. J. Comb. 40: 116-123 (2014) - [j15]Mirko Hornák
Minimum Number of Palettes in Edge Colorings. Graphs Comb. 30(3): 619-626 (2014) - [j14]Rafal Kalinowski, Mariusz Wozniak:
Edge-Distinguishing Index of a Graph. Graphs Comb. 30(6): 1469-1477 (2014) - 2013
- [j13]Rafal Kalinowski, Monika Pilsniak, Jakub Przybylo, Mariusz Wozniak:
Can Colour-Blind Distinguish Colour Palettes? Electron. J. Comb. 20(3): 23 (2013) - 2012
- [j12]Rafal Kalinowski, Monika Pilsniak, Mariusz Wozniak:
Preface. Discret. Math. 312(14): 2091 (2012)
2000 – 2009
- 2009
- [j11]Rafal Kalinowski, Monika Pilsniak, Mariusz Wozniak, Irmina A. Ziolo:
Arbitrarily vertex decomposable suns with few rays. Discret. Math. 309(11): 3726-3732 (2009) - [j10]Rafal Kalinowski, Monika Pilsniak, Mariusz Wozniak, Irmina A. Ziolo:
On-line arbitrarily vertex decomposable suns. Discret. Math. 309(22): 6328-6336 (2009) - 2007
- [j9]Agnieszka Görlich, Rafal Kalinowski, Mariusz Meszka, Monika Pilsniak, Mariusz Wozniak:
A note on decompositions of transitive tournaments II. Australas. J Comb. 37: 57-66 (2007) - [j8]Agnieszka Görlich, Rafal Kalinowski, Mariusz Meszka, Monika Pilsniak, Mariusz Wozniak:
A note on decompositions of transitive tournaments. Discret. Math. 307(7-8): 896-904 (2007) - [j7]Rafal Kalinowski, Mariusz Meszka:
Preface. Discret. Math. 307(11-12): 1221-1222 (2007) - [j6]Rafal Kalinowski, Mariusz Meszka:
Research Problems from the Fourth Cracow Conference (Czorsztyn, 2002). Discret. Math. 307(11-12): 1545-1549 (2007) - 2005
- [j5]Rafal Kalinowski, Monika Pilsniak, Mariusz Wozniak, Irmina A. Ziolo:
Some families of arbitrarily vertex decomposable graphs. Electron. Notes Discret. Math. 22: 451-454 (2005) - 2001
- [j4]Rafal Kalinowski, Antoni Marczyk, Mariusz Meszka, A. Pawel Wojda:
Preface. Discret. Math. 236(1-3): 1- (2001)
1990 – 1999
- 1993
- [j3]Rafal Kalinowski:
Small periods of endomorphisms of trees. Discret. Math. 121(1-3): 105-111 (1993) - 1990
- [j2]Rafal Kalinowski, Zdzislaw Skupien:
Large Isaacs' graphs are maximally non- Hamilton-connected. Discret. Math. 82(1): 101-104 (1990)
1980 – 1989
- 1982
- [j1]Janusz Jamrozik, Rafal Kalinowski, Zdzislaw Skupien:
A catalogue of small maximal nonhamiltonian graphs. Discret. Math. 39(2): 229-234 (1982)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: