Marcin Stawiski

Electron. J. Comb., 2026

2025

Breaking small automorphisms by list colourings.

[BibT_eX]

[DOI]

Jakub Kwasny

J. Graph Theory, February, 2025

Unfriendly Partition Conjecture Holds for Line Graphs.

[BibT_eX]

[DOI]

Rafal Kalinowski

Comb., February, 2025

On asymmetric colourings of graphs with bounded degrees and infinite motion.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2025

Distinguishing infinite star-free graphs.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2025

2024

List proper connection of 2-edge-connected graphs.

[BibT_eX]

[DOI]

Jakub Kwasny

Australas. J Comb., October, 2024

The distinguishing index of graphs with infinite minimum degree.

[BibT_eX]

[DOI]

Trevor M. Wilson

J. Graph Theory, January, 2024

2023

The role of the Axiom of Choice in proper and distinguishing colourings.

[BibT_eX]

[DOI]

Ars Math. Contemp., January, 2023

2022

Distinguishing infinite graphs with bounded degrees.

[BibT_eX]

[DOI]

J. Graph Theory, 2022

Corrigendum to "A bound for the distinguishing index of regular graphs" [European J. Combin. 89 (2020) 103145].

[BibT_eX]

[DOI]

Eur. J. Comb., 2022

2020

The optimal general upper bound for the distinguishing index of infinite graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2020

A bound for the distinguishing index of regular graphs.

[BibT_eX]

[DOI]