Publications

"Beauty is the first test: there is no permanent place in the world for ugly mathematics." Godfrey Harold Hardy

Set Theory • Graph Colourings • Regular Graphs

Journal Articles

  1. Marcin Stawiski
    Factorizations of regular graphs of infinite degree
    The Electronic Journal of Combinatorics 33 (1) P1.23 (2026)
  2. M. Stawiski
    Distinguishing infinite star-free graphs
    Applied Mathematics and Computation 495 129310 (2025)
  3. J. Kwaśny, M. Stawiski
    Breaking small automorphisms by list colourings
    Journal of Graph Theory 108 (2) 288–292 (2025)
  4. R. Kalinowski, M. Pilśniak, M. Stawiski
    Unfriendly Partition Conjecture Holds for Line Graphs
    Combinatorica 45 (1) (2025)
  5. Florian Lehner, Monika Pilśniak, Marcin Stawiski
    On asymmetric colourings of graphs with bounded degrees and infinite motion
    Ars Mathematica Contemporanea 25 #P4.09 (2025)
  6. J. Kwaśny, M. Stawiski
    List proper connection of 2-edge-connected graphs
    Australasian Journal of Combinatorics 90 (1) 80–84 (2024)
  7. M. Stawiski, T. Wilson
    The distinguishing index of graphs with infinite minimum degree
    Journal of Graph Theory 105 (1) 61–67 (2023)
  8. M. Stawiski
    The role of the Axiom of Choice in proper and distinguishing colourings
    Ars Mathematica Contemporanea 23 (3) (2023)
  9. F. Lehner, M. Pilśniak, M. Stawiski
    Distinguishing infinite graphs with bounded degrees
    Journal of Graph Theory 101 (1) 52–65 (2022)
  10. F. Lehner, M. Pilśniak, M. Stawiski
    Corrigendum to “A bound for the distinguishing index of regular graphs”
    European Journal of Combinatorics 101 (2022)
  11. F. Lehner, M. Pilśniak, M. Stawiski
    A bound for the distinguishing index of regular graphs
    European Journal of Combinatorics 89 (2020)
  12. M. Pilśniak, M. Stawiski
    The optimal general upper bound for the distinguishing index of infinite graphs
    Journal of Graph Theory 93 (4) 463–469 (2020)

Preprints

  1. M. Stawiski
    A new problem related to Eulerian graphs (arXiv)
  2. M. Stawiski
    Breaking small automorphisms of graphs of arbitrary cardinality (arXiv)
  3. M. Stawiski
    Irreducible distinguishing colourings and the Axiom of Choice (arXiv)
  4. J. Kwaśny, M. Stawiski
    Distinguishing regular graphs from lists (arXiv)
  5. W. Imrich, R. Kalinowski, F. Lehner, M. Pilśniak, M. Stawiski
    Distinguishing finite and infinite trees of arbitrary cardinality (arXiv)
  6. M. Stawiski
    A note on the 1-2-3 Theorem for infinite graphs (arXiv)
  7. J. Kwaśny, M. Stawiski
    List distinguishing index of graphs (arXiv)