Marcin Stawiski

Orcid: 0000-0003-2554-1754

According to our database1, Marcin Stawiski authored at least 10 papers between 2020 and 2025.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

2020
2021
2022
2023
2024
2025
0
1
2
3
4
3
2
1
2
2

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Breaking small automorphisms by list colourings.
J. Graph Theory, February, 2025

Unfriendly Partition Conjecture Holds for Line Graphs.
Comb., February, 2025

Distinguishing infinite star-free graphs.
Appl. Math. Comput., 2025

2024
List proper connection of 2-edge-connected graphs.
Australas. J Comb., October, 2024

The distinguishing index of graphs with infinite minimum degree.
J. Graph Theory, January, 2024

2023
The role of the Axiom of Choice in proper and distinguishing colourings.
Ars Math. Contemp., January, 2023

2022
Distinguishing infinite graphs with bounded degrees.
J. Graph Theory, 2022

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

2020
The optimal general upper bound for the distinguishing index of infinite graphs.
J. Graph Theory, 2020

A bound for the distinguishing index of regular graphs.
Eur. J. Comb., 2020


  Loading...