Rafał Kalinowski - Citegraph

Author Info

Name	Affiliation	Papers
RAFAŁ KALINOWSKI	Department of Discrete Mathematics, Faculty of Applied Mathematics AGH, Kraków, Poland 30-059	23
Collaborators	Citations	PageRank
24	48	10.75
Referers	Referees	References
60	113	98

Search Limit

100113

Publications (23 rows)

Collaborators (24 rows)

Referers (60 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
The Distinguishing Index Of Connected Graphs Without Pendant Edges	0	0.34	2020
Asymmetric colorings of products of graphs and digraphs	0	0.34	2019
A note on breaking small automorphisms in graphs.	0	0.34	2017
The distinguishing index of the Cartesian product of finite graphs.	2	0.41	2017
Bounds for Distinguishing Invariants of Infinite Graphs.	0	0.34	2017
Dense on-line arbitrarily partitionable graphs.	1	0.35	2017
Distinguishing Cartesian products of countable graphs.	3	0.47	2017
Distinguishing graphs by total colourings	1	0.41	2016
Dense arbitrarily partitionable graphs.	2	0.38	2016
Distinguishing graphs by edge-colourings.	1	0.38	2015
On the Cartesian product of of an arbitrarily partitionable graph and a traceable graph.	2	0.38	2014
How to personalize the vertices of a graph?	3	0.56	2014
Minimum Number of Palettes in Edge Colorings	3	0.47	2014
Edge-Distinguishing Index of a Graph	0	0.34	2014
Endomorphism Breaking in Graphs.	6	0.79	2014
Can Colour-Blind Distinguish Colour Palettes?	2	0.40	2013
Arbitrarily vertex decomposable suns with few rays	7	0.87	2009
On-line arbitrarily vertex decomposable suns	5	0.60	2009
A note on decompositions of transitive tournaments	0	0.34	2007
Research Problems from the Fourth Cracow Conference (Czorsztyn, 2002)	0	0.34	2007
Some families of arbitrarily vertex decomposable graphs	0	0.34	2005
Small periods of endomorphisms of trees	0	0.34	1993
A catalogue of small maximal nonhamiltonian graphs	10	1.22	1982