Publications

  1. S. Cichacz, K. Suchan, Zero-sum partitions of Abelian groups and their applications to magic- and antimagic-type labelings, Discrete Mathematics & Theoretical Computer Science 26:3 #14 (2024), DOI: 10.46298/dmtcs.12361 . (PDF)
  2. S. Cichacz, A. Görlich, K. Suchan, k-fault-tolerant graphs for p disjoint complete graphs of order c, Discussiones Mathematicae - Graph Theory 44(4) (2024), 1471-1484. DOI: 10.7151/dmgt.2504 . (PDF)
  3. S. Cichacz, K. Suchan, Zero-sum partitions of Abelian groups of order 2n, Discrete Mathematics & Theoretical Computer Science 25:1 #6 (2023), DOI: 10.46298/dmtcs.9914 . (PDF)
  4. 2. M. Anholcer, S. Cichacz, I. Peterin, On b-acyclic chromatic number of a graph, Computational and Applied Mathematics 42:21 (2023), DOI: 10.1007/s40314-022-02156-y . (PDF)
  5. S. Cichacz, A. Görlich, A. Semaničová-Feňovčíková, Upper bounds on distance vertex irregularity strength of some families of graphs, Opuscula Mathematica 42(4) (2022), 561-571. DOI: 10.7494/OpMath.2022.42.4.561 . (PDF)
  6. S. Cichacz, Zs. Tuza, Realization of digraphs in Abelian groups and its consequences, J. Graph Theory 100(2) (2022) 331–345, DOI: 10.1002/jgt.22782 . (PDF)
  7. S. Cichacz, On some graph-cordial Abelian groups, Discrete Mathematics 345 (2022) 112815 DOI: 10.1016/j.disc.2022.112815 . (PDF)
  8. S. Cichacz, A. Görlich, A. Semaničová-Feňovčíková, Upper bounds on inclusive distance vertex irregularity strength, Graphs and Combinatorics 37 (2021) 2713–2721. DOI: 10.1007/s00373-021-02385-8 . (PDF)
  9. M. Anholcer, S. Cichacz, D. Froncek, R. Simanjuntak, J. Qiu, Group distance magic and antimagic hypercubes, Discrete Mathematics 344 (2021) 112625. DOI: 10.1016/j.disc.2021.112625 . (PDF)
  10. S. Cichacz, A. Görlich, Zs. Tuza, Z2xZ2-cordial cycle-free hypergraphs, Discussiones Mathematicae - Graph Theory 41 (2021) 1021-1040. DOI: 10.7151/dmgt.2226 . (PDF)
  11. S. Cichacz, K. Suchan, Vertex-fault tolerant complete matching in bipartite graphs: the biregular case, Discrete Applied Mathematics 302 (2021) 54-66. DOI: 10.1016/j.dam.2021.06.005 . (PDF)
  12. S. Cichacz, T. Hinc, A note on magic rectangle set MRSΓ(2k+1,4,4l+2), Journal of Combinatorial Designs 29 (2021) 502-507. DOI: 10.1002/jcd.21781 . (PDF)
  13. S. Cichacz, T. Hinc, A magic rectangle set on Abelian groups and its application, Discrete Applied Mathematics 288 (2021) 201-210. DOI: 10.1016/j.dam.2020.08.029 . (PDF)
  14. S. Cichacz, K. Szopa, Modular edge-gracefulness of graphs without stars, Symmetry 12(12) (2020) 2013. DOI: 10.3390/sym12122013 . (PDF)
  15. S. Cichacz, P. Dyrlaga, D. Froncek, Group distance magic Cartesian product of two cycles, Discrete Mathematics 343 (2020) 111807. DOI: 10.1016/j.disc.2019.111807 . (PDF)
  16. M. Anholcer, S. Cichacz, Note on the group edge irregularity strength of graphs, Applied Mathematics and Computation 350 (2019) 237-241. DOI: 10.1016/j.amc.2019.01.007 . (PDF)
  17. M. Anholcer, S. Cichacz, J. Przybyło, Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs, Applied Mathematics and Computation 343 (2019), 149-155. DOI: 10.1016/j.amc.2018.09.056 . (PDF)
  18. S. Cichacz, B. Freyberg, D. Froncek, Orientable Zn-distance magic graphs, Discussiones Mathematicae - Graph Theory 39 (2019) 533-546, DOI: 10.7151/dmgt.2094 . (PDF)
  19. S. Cichacz, I.A. Zioło, 2-swappable graphs, AKCE Int. J. Graphs Comb. 15(3) (2018) 242-250, 10.1016/j.akcej.2017.11.002 . (PDF)
  20. S. Cichacz, J. Przybyło, Group twin edge coloring of graphs, Discrete Mathematics & Theoretical Computer Science 20:1 (2018), #24. PDF
  21. M. Anholcer, S. Cichacz, R. Jura, A. Marczyk, Note on group irregularity strength of disconnected graphs, Open Mathematics 16 (2018), 154-160, DOI: 10.1515/math-2018-0017 . (PDF)
  22. S. Cichacz, Zero sum partition of Abelian groups into sets of the same order and its applications, Electronic Journal of Combinatorics 25(1) (2018), #P1.20. PDF
  23. S. Cichacz, A. Görlich, Constant sum partition of set of integers and distance magic graphs, Discussiones Mathematicae - Graph Theory 38 (2018), 97-106, DOI: 10.7151/dmgt.1991 . (PDF)
  24. M. Anholcer, S. Cichacz, Group irregular labelings of disconnected graphs, Contributions to Discrete Mathematics 12(2) (2017) 158-166, PDF
  25. S. Arumugam, S. Cichacz, D. Froncek, Preface in Special Issue, Electronic Notes in Discrete Math. 60 (2017), DOI: 10.1016/j.endm.2017.06.001 . (PDF)
  26. S. Cichacz, On zero sum-partition of Abelian groups into three sets and group distance magic labeling, Ars Mathematica Contemporanea 13(2) (2017), 417-425. (PDF)
    [Corrigendum: Ars Mathematica Contemporanea 16(2) (2019), 641 (PDF)]
  27. M. Anholcer, S. Cichacz, I. Peterin, Spectra of graphs and closed distance magic labelings, Discrete Mathematics 339(7) (2016) 1915-1923, DOI: 10.1016/j.disc.2015.12.025 . (PDF)
  28. S. Cichacz, M. Nikodem, Note on union of distance magic graphs, Discussiones Mathematicae - Graph Theory 37 (2017) 239-249, DOI: 10.7151/dmgt.1932 . (PDF)
  29. S. Cichacz, D. Froncek, I. Singgih, Vertex magic total labelings of 2-regular graphs, Discrete Mathematics 340(1) (2017) 3117-3124, DOI: 10.1016/j.disc.2016.06.022 . (PDF)
  30. S. Cichacz, Distance magic (r,t)-hypercycles, Utilitas Mathematica 101 (2016), 283-294.
  31. S. Cichacz, D. Froncek, K. Sugeng, Sanming Zhou, Group distance magic and antimagic graphs, Acta Mathematica Sinica, English Series 32(10) (2016), 1159-1176, DOI: 10.1007/s10114-016-4646-9 (PDF).
    [Extended abstract: Electronic Notes in Discrete Math. 48 (2015), 41–48. DOI:10.1016/j.endm.2015.05.007. (PDF)]
  32. M. Anholcer, S. Cichacz, I. Peterin, Spectra of graphs and closed distance magic labelings, Discrete Mathematics 339(7) (2016) 1915-1923, DOI: 10.1016/j.disc.2015.12.025 . (PDF)
  33. S. Cichacz, D. Froncek, E. Krop, C. Raridan. Distance magic Cartesian products of graphs, Discussiones Mathematicae - Graph Theory 36 (2016) 299-308, DOI: 10.7151/dmgt.1852 . (PDF)
  34. M. Anholcer, S. Cichacz, Group sum chromatic number of graphs, European Journal of Combinatorics 55 (2016) 73-81, DOI: 10.1016/j.ejc.2016.02.002 . (PDF)
  35. S. Cichacz, D. Froncek, Distance magic circulant graphs, Discrete Mathematics 339(1) (2016) 84-94, DOI: 10.1016/j.disc.2015.07.002 . (PDF)
  36. M. Anholcer, S. Cichacz, I. Peterin, A. Tepeh, Distance magic labeling and two products of graphs, Graphs and Combinatorics 31(5) (2015) 1125-1136, DOI: 10.1007/s00373-014-1455-8 . (PDF)
  37. M. Anholcer, S. Cichacz, Note on distance magic products G o C4, Graphs and Combinatorics 31(5) (2015) 1117-1124, DOI: 10.1007/s00373-014-1453-x . (PDF)
  38. S. Cichacz, A Γ-magic rectangle set and group distance magic labeling, IWOCA 2014, Lecture Notes in Computer Science IWOCA 2014, Lecture Notes in Computer Science 8986 (2015) 122-127, DOI: 10.1007/978-3-319-19315-1_11 . (PDF)
  39. M. Anholcer, S. Cichacz, M. Milanič, Group irregularity strength of connected graphs, Journal of Combinatorial Optimization 30(1) (2015) 1-17, DOI: 10.1007/s10878-013-9628-6 . (PDF)
  40. M. Anholcer, S. Cichacz, I. Peterin, A. Tepeh, Group distance magic labeling of direct product of graphs, Ars Mathematica Contemporanea 9 (2015) 93–108. PDF
  41. S. Cichacz, Distance magic graphs GxCn, Discrete Applied Mathematics 177(20) (2014) 80-87, DOI: 10.1016/j.dam.2014.05.044 . (PDF)
  42. S. Cichacz, S. Dib, D. Froncek, Decomposition of complete graphs into (0,2)-prisms, Czechoslovak Mathematical Journal 64 No. 1 (2014) 37-43, DOI: 10.1007/s10587-014-0080-2 . (PDF)
  43. S. Cichacz, Note on group distance magic graphs G[C4], Graphs and Combinatorics 30(3) (2014) 565-571, DOI: 10.1007/s00373-013-1294-z . (PDF)
  44. S. Cichacz, Note on group distance magic complete bipartite graphs, Central European Journal of Mathematics 12(3) (2014) 529-533, DOI: 10.2478/s11533-013-0356-z . (PDF)
  45. S. Cichacz, D. Froncek, M. Meszka, Decomposition of complete graphs into small generalized prisms, AKCE Int. J. Graphs Comb. 10 No. 3 (2013), 285-293. PDF
  46. S. Cichacz, Group distance magic labeling of some cycle-related graphs, Australas. J. Combinatorics 57 (2013) 235–243. PDF
  47. S. Cichacz, A. Görlich, Zs. Tuza, Cordial labeling of hypertrees, Discrete Mathematics 313 (22) (2013) 2518-2524, DOI: 10.1016/j.disc.2013.07.025 . (PDF)
  48. S. Cichacz, D. Froncek, P. Kováŕ, Decomposition of complete bipartite graphs into generalized prisms, European Journal of Combinatorics 34 (2013) 104-110, DOI: 10.1016/j.ejc.2012.07.018 . (PDF)
  49. S. Cichacz, D. Froncek, M. Meszka, Decomposition of complete graphs into small bipartite prisms, Congressus Numerantium 211 (2012) 133-140.
  50. S. Cichacz, A. Görlich, M. Nikodem, A. Żak, A lower bound on the size of (H,1)-vertex stable graphs, Discrete Mathematics 312 (2012) 3026–3029, DOI: 10.1016/j.disc.2012.06.023 . (PDF)
  51. S. Cichacz, T. Wieja, Interactive Presentations of Selected Descriptive Geometry Problems in the Flash MX Program, The Journal of Polish Society of Geometry and Engineering Graphics 22 (2011) 25-30. PDF
  52. S. Cichacz, A. Görlich, M. Zwonek, A. Żak, On (Cn, k) stable graphs, Electronic Journal of Combinatorics 18(1) (2011), #P205 PDF
  53. S. Cichacz, A. Görlich, Open trails in digraphs, Opuscula Mathematica 31/4 (2011) 599-604, DOI: 10.7494/OpMath.2011.31.4.599 . (PDF)
  54. S. Cichacz, J. Przybyło, Irregular edge coloring of 2-regular graphs, DMTCS vol. 13:1 (2011) 1-12. PDF
  55. S. Cichacz, D. Froncek, Bipartite graphs decomposable into closed trails, J. Combin. Math. Combin. Comput. 74 (2010) 207-216.
  56. S. Cichacz, J. Przybyło, Vertex-distinguishing edge-colorings of linear forests, Discussiones Mathematicae - Graph Theory 30(1) (2010) 95-103. PDF
  57. S. Cichacz, A. Görlich, Edge-disjoint open trails in complete bipartite multigraphs, Graphs and Comb. 26 (2) (2010) 207-214, DOI: 10.1007/s00373-010-0904-2 . (PDF)
  58. S. Cichacz, 2-splittable and cordial graphs, Opuscula Mathematica 30/1 (2010) 61-67. PDF
  59. S. Cichacz, D. Froncek, P. Kováŕ, Note on decomposition of Kn,n into (0,j)-prisms, Lecture Notes in Computer Science 5874 (2009) 125-133, DOI: 10.1007/978-3-642-10217-2_15 . (PDF)
  60. S. Cichacz, D. Froncek, A. Khodkar, W. Xu, Super edge-graceful paths and cycles, Bulletin of ICA 57 (2009) 79-90.
  61. S. Cichacz, D. Froncek, Factorization of Kn,n into (0,j)-prisms, Information Processing Letters 109 (2009) 932-934, DOI: 10.1016/j.ipl.2009.04.024 . (PDF)
  62. S. Cichacz, J. Przybyło, M. Woźniak, Decompositions of pseudographs into closed trails of even sizes, Discrete Mathematics 309 (2009) 4903-4908, DOI: 10.1016/j.disc.2008.04.024 . (PDF)
  63. S. Cichacz, Y. Egawa, M. Woźniak, Arbitrary decompositions into open and closed trails, Discrete Mathematics 309 (2009) 1511-1516, DOI: 10.1016/j.disc.2008.03.004 . (PDF)
  64. S. Cichacz, M. Hornák, Decomposition of bipartite graphs into closed trails, Czechoslovak Mathematical Journal 59, No. 1 (2009) 129-144. PDF
  65. S. Cichacz, A. Görlich, The complete multigraphs and their decompositions into open trails, Australas. J. Combinatorics 42 (2008) 159-164. PDF
  66. S. Cichacz, J. Przybyło, M. Woźniak, Irregular edge-colorings of sums of cycles of even lengths, Australas. J. Combinatorics 40 (2008) 41-56. PDF
  67. S. Cichacz, T. Wieja, Application of the Flash MX program to computer visualization of the conics constructions in the Monge and Mapping projections, 28. Konference o geometrii a grafice. Lednice : JČMF, (2008) 47-51.
  68. S. Cichacz, T. Wieja, Assessment of the properties of the Flash MX program in presentation of solid geometry problems, Geometry and Computer Graphics 2007 Sbornik 27. konference o geometrii a poctacov grafice, Nedvedice, Jihoceska Univerzita v Ceskych Budejovivich 37-44.
  69. S. Cichacz, T. Wieja, Computer Aided Teaching of Central Projection in the Flash MX Program Proceedings of Symposium on Computional Geometry SCG'2007 Kocovce September 2007, Bratislava 2007, 23-27.
  70. S. Cichacz, Decomposition of complete bipartite digraphs and even complete bipartite multigraphs into closed trails, Discussiones Mathematicae - Graph Theory 27 (2) (2007) 241-249. PDF
  71. S. Cichacz, I.A. Zioło, On arbitrarily vertex decomposable unicyclic graphs with dominating cycle, Discussiones Mathematicae - Graph Theory 26 (3) (2006) 403-412. PDF
  72. S. Cichacz, A. Görlich, Decomposition of complete bipartite graphs into open trails, Electronic Notes in Discrete Mathematics 24 (2006) 53-55, DOI: 10.1016/j.endm.2006.06.009 . (PDF)
  73. S. Cichacz, A. Görlich, A. Marczyk, J. Przybylo, M. Wozniak, Arbitrarily vertex decomposable caterpillars with four or five leaves, Discussiones Mathematicae - Graph Theory 26 (2) (2006) 291-305. PDF
  74. S. Cichacz, T. Sulima-Samujłło, T. Wieja, Computer Aided Visualisation of Problems Related to Polyhedra, Proceedings of Symposium on Computional Geometry SCG'2006 Kocovce September 2006, Bratislava 2006, 24-28.
  75. S. Cichacz, T. Sulima-Samujłło, T. Wieja, Application of the Flash MX program to visualization of selected metric problems, Proceedings of Symposium on Computional Geometry SCG'2005 Kocovce September 2005, Bratislava 2005, 21-25.
  76. S. Cichacz, Zastosowanie teorii grafów w statyce - Applications of graph theory in statics, Zeszyty Studenckiego Towarzystwa Naukowego - Laureaci V Edycji Konkursu Diamenty AGH, Kraków 2004, 45-55.
  77. S. Cichacz, T. Sulima-Samujłło, Application of B-spline to representation of selected lines and surfaces, Proceedings of Symposium on Computional Geometry SCG'2004 Kocovce November 2004, Bratislava 2004, 21-26.