Rafal Kalinowski

According to our database1, Rafal Kalinowski authored at least 28 papers between 1982 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
The distinguishing index of connected graphs without pendant edges.
Ars Math. Contemp., 2020

2019
Asymmetric colorings of products of graphs and digraphs.
Discret. Appl. Math., 2019

2017
Distinguishing Cartesian products of countable graphs.
Discuss. Math. Graph Theory, 2017

A note on breaking small automorphisms in graphs.
Discret. Appl. Math., 2017

Dense on-line arbitrarily partitionable graphs.
Discret. Appl. Math., 2017

Bounds for Distinguishing Invariants of Infinite Graphs.
Electron. J. Comb., 2017

The distinguishing index of the Cartesian product of finite graphs.
Ars Math. Contemp., 2017

2016
Dense arbitrarily partitionable graphs.
Discuss. Math. Graph Theory, 2016

Preface.
Discret. Math., 2016

Distinguishing graphs by total colourings.
Ars Math. Contemp., 2016

2015
Distinguishing graphs by edge-colourings.
Eur. J. Comb., 2015

2014
Edge-Distinguishing Index of a Graph.
Graphs Comb., 2014

Minimum Number of Palettes in Edge Colorings.
Graphs Comb., 2014

How to personalize the vertices of a graph?
Eur. J. Comb., 2014

On the Cartesian product of of an arbitrarily partitionable graph and a traceable graph.
Discret. Math. Theor. Comput. Sci., 2014

Endomorphism Breaking in Graphs.
Electron. J. Comb., 2014

2013
Can Colour-Blind Distinguish Colour Palettes?
Electron. J. Comb., 2013

2009
On-line arbitrarily vertex decomposable suns.
Discret. Math., 2009

Arbitrarily vertex decomposable suns with few rays.
Discret. Math., 2009

2007
Research Problems from the Fourth Cracow Conference (Czorsztyn, 2002).
Discret. Math., 2007

Preface.
Discret. Math., 2007

A note on decompositions of transitive tournaments.
Discret. Math., 2007

A note on decompositions of transitive tournaments II.
Australas. J Comb., 2007

2005
Some families of arbitrarily vertex decomposable graphs.
Electron. Notes Discret. Math., 2005

2001
Preface.
Discret. Math., 2001

1993
Small periods of endomorphisms of trees.
Discret. Math., 1993

1990
Large Isaacs' graphs are maximally non- Hamilton-connected.
Discret. Math., 1990

1982
A catalogue of small maximal nonhamiltonian graphs.
Discret. Math., 1982


  Loading...