Research interest:

• colourings of graphs: generalized colouring, acyclic colouring, sum-list colouring, equitable choosability
• rainbow connections in digraphs
• proper connections in digraphs
• games on graphs:colouring games, domination games
• alliances and secure sets in graphs
• partitions and decomposition of graphs
• hereditary properties of graphs
• extremal properties of graphs

Publications:

• A. Dailly, É. Duchêne, A. Parreau , E. Sidorowicz The neighbour sum distinguishing relaxed edge colouring, , Appl. Math. Comput. 419 (2022) 126864. doi.org/10.1016/j.amc.2021.126864
• E. Drgas-Burchardt , A. Drzystek , E. Sidorowicz, Sum-list-colouring of Θ-hypergraphs , Ars Mathematica Contemporanea (2022). doi: 10.26493/1855-3974.2083.e80
• A. Fiedorowicz, E. Sidorowicz, E. Sopena, Proper connection and proper-walk connection of digraphs, Appl. Math. Comput. 410 (2021) 126253doi.org/10.1016/j.amc.2021.126253
• E. Drgas-Burchardt, H. Furmańczyk, E. Sidorowicz, Equitable improper choosability of graphs, Theoretical Computer Science 844 (2020) 34-45. doi.org/10.1016/j.tcs.2020.08.001
• E. Drgas-Burchardt, H. Furmańczyk, E. Sidorowicz, Equitable d-degenerate choosability of graphs, In: Gąsieniec L., Klasing R., Radzik T. (eds) Combinatorial Algorithms. IWOCA 2020. Lecture Notes in Computer Science, vol 12126. Springer, Vol. 12126, 251-263 (2020). doi.org/10.1007/978-3-030-48966-3_19
• M. Borowiecki, P. Borowiecki, E. Drgas-Burchardt, E. Sidorowicz, Graph classes generated by Mycielskian, Discuss. Math. Graph Theory 40 (2020) 1163-1173. doi:10.7151/dmgt.2345
• M, Borowiecki, A. Fiedorowicz, E. Sidorowicz, Zs. Tuza, Independent (k + 1)-domination in k-trees, Discrete Appl. Math. 284 (2020) 99-110. doi.org/10.1016/j.dam.2020.03.019
• E. Drgas-Burchardt and E. Sidorowicz, Sum-list colouring of unions of a hypercycle and a path with at most two vertices in common, Discuss. Math. Graph Theory 40 (2020) 893–917. doi.org/10.7151/dmgt.2312
• M. Borowiecki, A. Fiedorowicz, E. Sidorowicz, Connected domination game, Appl. Anal. Discrete Math. 13 (2019), 261-289. doi.org/10.2298/AADM171126020B
• E. Drgas-Burchardt, J. Dybizbański, H. Furmańczyk, E. Sidorowicz, Equitable List Vertex Colourability and Arboricity of Grids, Filomat. 32 (18) (2018) 6353-6374. doi.org/10.2298/FIL1818353D
• P. Borowiecki, E. Sidorowicz, Dynamic F-free Coloring of Graphs, Graphs Combin. 34 (2018) 457-475. doi.org/10.1007/s00373-018-1886-8
• M. Borowiecki, E. Drgas-Burchardt, E. Sidorowicz, P-apex graphs, Discuss. Math. Graph Theory 38 (2018) 323-349. doi.org/10.7151/dmgt.2041
• E. Sidorowicz, E. Sopena, Rainbow connections in digraphs, Discrete Appl. Math. 243 (2018) 248-261. doi.org/10.1016/j.dam.2018.01.014
• E. Sidorowicz, E. Sopena, Strong rainbow connection in digraphs, Discrete Appl. Math. 238 (2018) 133-143. doi.org/10.1016/j.dam.2017.12.017
• O. Baudon, J. Przybyło, M. Senhaji, E. Sidorowicz, E. Sopena, M. Woźniak, The neighbour-sum-distinguishing edge-colouring game, Discrete Math. 340 (2017) 1564-1572. doi.org/10.1016/j.disc.2017.02.019
• A. Fiedorowicz, E. Sidorowicz, Acyclic colorings of graphs with bounded degree, Sci. China Math. 59(7) (2016) 1427-1440. doi.org/10.1007/s11425-016-5126-5
• E. Sidorowicz, The Relaxed Game Chromatic Number of Graphs with Cut-Vertices, Graphs Combin. 31 (2015), 2381-2400. doi.org/10.1007/s00373-014-1522-1
• K. Jesse-Józefczyk, E. Sidorowicz, Secure sets and their expansion in cubic graphs, Cent. Eur. J. Math. 12 (2014), 1664-1673. doi.org/ 10.2478/s11533-014-0411-4
• K. Jesse-Józefczyk, E. Sidorowicz, Global security in claw-free cubic graphs, Discrete Appl. Math. 175 (2014), 11-23. doi.org/10.1016/j.dam.2014.05.027
• P. Dorbec, I. Schiermeyer, E. Sidorowicz, E. Sopena, Rainbow Connection in Oriented Graphs, Discrete Appl. Math. 179 (2014), 69-78. doi.org/10.1016/j.dam.2014.07.018
• M. Borowiecki, E. Drgas-Burchardt, E. Sidorowicz, A feedback vertex set of 2-degenerate graphs, Theoretical Computer Science 557 (2014), 50-58. doi.org/10.1016/j.tcs.2014.08.016
• E. Sidorowicz, On the relaxed colouring game and the unilateral colouring game, Graphs Combin. 30 (2014), 1013-1036. doi.org/10.1007/s00373-013-1326-8
• A. Fiedorowicz, E. Sidorowicz, Acyclic improper colouring of graphs with maximum degree 4, Sci. China Math. 57 (2014) 2485-2494. doi.org/10.1007/s11425-014-4828-9
• K. Amin, J. Faudree, R.J. Gould, E. Sidorowicz, On the non-(p-1)-partite K_p-free graphs, Discuss. Math. Graph Theory 33 (2013) 9-23. doi.org/10.7151/dmgt.1654
• P. Borowiecki, E. Sidorowicz, Dynamic coloring of graphs, Fundam. Inform. 114 2 (2012) 105-12. doi.org/10.3233/FI-2012-620
• M. Borowiecki, K. Jesse-Józefczyk, E. Sidorowicz, The complexity of some acyclic improper colouring, Discrete Math. 311 (2011) 732-737. doi.org/10.1016/j.disc.2011.01.023
• M. Borowiecki, A. Fiedorowicz, K. Jesse-Józefczyk, E. Sidorowicz, Acyclic colourings of graphs with bounded degree, Discrete Math. Theoret. Comput. Sci. 12 (1) (2010) 59-74.
• E. Sidorowicz, Colouring game and generalized colouring game on graphs with cut-vertices, Discuss. Math. Graph Theory 30 (2010) 499-533.
• M. Borowiecki, P. Borowiecki, E. Sidorowicz, Z. Skupień, On Extremal Size of Locally k-tree Graphs, Czech. Math. J. 60 (135) (2010) 571-587.
• M. Borowiecki, E. Sidorowicz, Zs. Tuza, Game list colouring, Electron. J. Combin. 14 (2007).
• E. Sidorowicz, Size of weakly saturated graphs, Discrete Math. 307 (2007) 1486-1492.
• E. Sidorowicz, The game chromatic number and the colouring number of cactuses, Inform. Process. Lett. 102 (2007) 147-151.
• M. Borowiecki, E. Sidorowicz, Generalised game colouring of graphs, Discrete Math. 307 (2007) 1225-1231.
• A. Hoffmann, E. Sidorowicz, L. Volkmann, Extremal bipartite graphs with a unique k-factor, Discuss. Math. Graph Theory 26 (2006) 181-192.
• P. Borowiecki, E. Sidorowicz, Efektywność algorytmów dynamicznego kolorowania grafów-zastosowanie w sieciach optycznych WDM, Zeszyty Naukowe Politechniki Śląskiej-(Automatyka; 144), 1727 (2006) 135-142.
• E. Sidorowicz, Marking games, Electronic Notes in Discrete Math. 24 (2006) 211-214.
• M. Borowiecki, I. Schiermeyer, E. Sidorowicz, Ramsey (K_{1,2},K_3)-minimal graphs, Electron. J. Combin. 12 (2005).
• M. Borowiecki, M. Hałuszczak, E. Sidorowicz, On Ramsey minimal graphs, Discrete Math. 286 (2004) 37-43.
• M. Borowiecki, E. Sidorowicz, Some extremal problems of graphs with local constraints, Discrete Math. 251 (2002) 19-32.
• M. Borowiecki, E. Sidorowicz, Weakly P-saturated graphs, Discuss. Math. Graph Theory 22 (2002) 17-29.
• M. Borowiecki, D. Michalak, E. Sidorowicz, Generalized domination, independance and irredundance in graphs, Discuss. Math. Graph Theory 17 (1997) 147-153.
• E. Sidorowicz, Size of C_3-saturated graphs, Zeszyty Naukowe Politechniki Rzeszowskiej 118 (1993) 61-66.

Selected talks:

• Equitable d-degenerate choosability of graphs, 31st International Workshop on Combinatorial Algorithms (IWOCA 2020) (VIRTUAL) Bordeaux, France (with E. Drgas-Burchardt, H. Furmańczyk)
• Rainbow Connections in Digraphs,18th Workshop on Graph Theory – CID 2019, Piechowice, Poland (with E. Sopena)
• Sum-list colouring of hypergraphs, The 28th Workshop 3in1 2019 Dosłońce, Poland (with E. Drgas-Burchardt, A. Drzystek)
• invited talk- Rainbow Connections in Digraphs, The 6th Gdańsk Workshop on Graph Theory 2018, Gdańsk, Poland
• Connected domination games on graphs , The 26th Workshop 3in1 2017, Dosłońce, Poland (with M. Borowiecki, A. Fiedorowicz)
• invited talk-On acyclic vertex colourings of graphs , 25th Workshop on Cycles and Colourings 2017, Nový Smokovec, Slovakia
• Strong Rainbow Connection in Digraphs , Bordeaux Graph Workshop 2016, Bordeaux, France (with E. Sopena)
• Connected domination game on graphs, 6th Polish Combinatorial Conference 2016, Będlewo, Poland (with M. Borowiecki, A. Fiedorowicz)
• Feedback Vertex Sets, 16th Workshop on Graph Theory – CID 2015, Szklarska Poręba, Poland (with M. Borowiecki)
• New type of Ramsey numbers, 7th Cracow Conference on Graph Theory Rytro 2014, Rytro, Poland (with A. Fiedorowicz)
• Graph decompositions and the expansion of secure sets, 5th Polish Combinatorial Conference 2014, Będlewo, Poland (with K. Jesse-Józefczyk)
• On the unilateral colouring game, Bordeaux Graph Workshop 2014, Bordeaux, France
• Minimum feedback vertex set of k-degenerate graphs, 17th C5 Graph Theory Workshop 2013, Rathen, Germany (with M. Borowiecki, E. Drgas-Burchardt)
• Claw-free cubic graphs and their global secure sets, Bordeaux Graph Workshop 2012, Bordeaux, France (with K. Jesse-Józefczyk)
• On acyclic vertex colourings of graphs with bounded degree, 7th Slovenian International Conference on Graph Theory 2011, Bled, Slovenia