A bound for the distinguishing index of regular graphs. - Florian Lehner; Monika Pilsniak; Marcin Stawiski (Eur. J. Comb., 2020)

The optimal general upper bound for the distinguishing index of infinite graphs. - Monika Pilsniak; Marcin Stawiski (J. Graph Theory, 2020)

Corrigendum to "A bound for the distinguishing index of regular graphs" [European J. Combin. 89 (2020) 103145]. - Florian Lehner; Monika Pilsniak; Marcin Stawiski (Eur. J. Comb., 2022)

Distinguishing infinite graphs with bounded degrees. - Florian Lehner; Monika Pilsniak; Marcin Stawiski (J. Graph Theory, 2022)

The role of the Axiom of Choice in proper and distinguishing colourings. - Marcin Stawiski (Ars Math. Contemp., 2023)

The distinguishing index of graphs with infinite minimum degree. - Marcin Stawiski; Trevor M. Wilson (J. Graph Theory, 2024)

List proper connection of 2-edge-connected graphs. - Jakub Kwasny; Marcin Stawiski (Australas. J Comb., 2024)

Distinguishing infinite star-free graphs. - Marcin Stawiski (Appl. Math. Comput., 2025)

Unfriendly Partition Conjecture Holds for Line Graphs. - Rafal Kalinowski; Monika Pilsniak; Marcin Stawiski (Comb., 2025)

Breaking small automorphisms by list colourings. - Jakub Kwasny; Marcin Stawiski (J. Graph Theory, 2025)