Generalized domination, independence and irredudance in graphs. - Mieczyslaw Borowiecki; Danuta Michalak; Elzbieta Sidorowicz (Discuss. Math. Graph Theory, 1997)

Some extremal problems of graphs with local constraints. - Mieczyslaw Borowiecki; Elzbieta Sidorowicz (Discret. Math., 2002)

Weakly P-saturated graphs. - Mieczyslaw Borowiecki; Elzbieta Sidorowicz (Discuss. Math. Graph Theory, 2002)

On Ramsey minimal graphs. - Mieczyslaw Borowiecki; Mariusz Haluszczak; Elzbieta Sidorowicz (Discret. Math., 2004)

Ramsey (K1,2,K3)-Minimal Graphs. - Mieczyslaw Borowiecki; Ingo Schiermeyer; Elzbieta Sidorowicz (Electron. J. Comb., 2005)

Extremal bipartite graphs with a unique k-factor. - Arne Hoffmann; Elzbieta Sidorowicz; Lutz Volkmann (Discuss. Math. Graph Theory, 2006)

Marking Games. - Elzbieta Sidorowicz (Electron. Notes Discret. Math., 2006)

Game List Colouring of Graphs. - Mieczyslaw Borowiecki; Elzbieta Sidorowicz; Zsolt Tuza (Electron. J. Comb., 2007)

Generalised game colouring of graphs. - Mieczyslaw Borowiecki; Elzbieta Sidorowicz (Discret. Math., 2007)

Size of weakly saturated graphs. - Elzbieta Sidorowicz (Discret. Math., 2007)

The game chromatic number and the game colouring number of cactuses. - Elzbieta Sidorowicz (Inf. Process. Lett., 2007)

Preface of guest editors. - Piotr Borowiecki; Danuta Michalak; Elzbieta Sidorowicz (Discuss. Math. Graph Theory, 2009)

Colouring game and generalized colouring game on graphs with cut-vertices. - Elzbieta Sidorowicz (Discuss. Math. Graph Theory, 2010)

Acyclic colourings of graphs with bounded degree. - Mieczyslaw Borowiecki; Anna Fiedorowicz; Katarzyna Jesse-Józefczyk; Elzbieta Sidorowicz (Discret. Math. Theor. Comput. Sci., 2010)

Preface. - Piotr Borowiecki; Ewa Drgas-Burchardt; Elzbieta Sidorowicz (Discuss. Math. Graph Theory, 2011)

Dynamic Coloring of Graphs. - Piotr Borowiecki; Elzbieta Sidorowicz (Fundam. Informaticae, 2012)

On the non-(p-1)-partite Kp-free graphs. - Kinnari Amin; Jill R. Faudree; Ronald J. Gould; Elzbieta Sidorowicz (Discuss. Math. Graph Theory, 2013)

Preface. - Ewa Drgas-Burchardt; Mariusz Haluszczak; Maria Kwasnik; Danuta Michalak; Elzbieta Sidorowicz (Discuss. Math. Graph Theory, 2013)

Rainbow connection in oriented graphs. - Paul Dorbec; Ingo Schiermeyer; Elzbieta Sidorowicz; Éric Sopena (Discret. Appl. Math., 2014)

Global security in claw-free cubic graphs. - Katarzyna Jesse-Józefczyk; Elzbieta Sidorowicz (Discret. Appl. Math., 2014)

On the Relaxed Colouring Game and the Unilateral Colouring Game. - Elzbieta Sidorowicz (Graphs Comb., 2014)

A feedback vertex set of 2-degenerate graphs. - Mieczyslaw Borowiecki; Ewa Drgas-Burchardt; Elzbieta Sidorowicz (Theor. Comput. Sci., 2014)

Acyclic colourings of graphs with bounded degree. - Anna Fiedorowicz; Elzbieta Sidorowicz (CoRR, 2015)

The Relaxed Game Chromatic Number of Graphs with Cut-Vertices. - Elzbieta Sidorowicz (Graphs Comb., 2015)

The neighbour-sum-distinguishing edge-colouring game. - Olivier Baudon; Jakub Przybylo; Mohammed Senhaji; Elzbieta Sidorowicz; Éric Sopena; Mariusz Wozniak (Discret. Math., 2017)

Preface. - Ewa Drgas-Burchardt; Elzbieta Sidorowicz (Discuss. Math. Graph Theory, 2017)

Strong rainbow connection in digraphs. - Elzbieta Sidorowicz; Éric Sopena (Discret. Appl. Math., 2018)

Rainbow connections in digraphs. - Elzbieta Sidorowicz; Éric Sopena (Discret. Appl. Math., 2018)

P-apex graphs. - Mieczyslaw Borowiecki; Ewa Drgas-Burchardt; Elzbieta Sidorowicz (Discuss. Math. Graph Theory, 2018)

Dynamic F-free Coloring of Graphs. - Piotr Borowiecki; Elzbieta Sidorowicz (Graphs Comb., 2018)

Equitable d-degenerate Choosability of Graphs. - Ewa Drgas-Burchardt; Hanna Furmanczyk; Elzbieta Sidorowicz (IWOCA, 2020)

Independent (k+1)-domination in k-trees. - Mieczyslaw Borowiecki; Anna Fiedorowicz; Elzbieta Sidorowicz; Zsolt Tuza (Discret. Appl. Math., 2020)

Graph classes generated by Mycielskians. - Mieczyslaw Borowiecki; Piotr Borowiecki; Ewa Drgas-Burchardt; Elzbieta Sidorowicz (Discuss. Math. Graph Theory, 2020)

Sum-list colouring of unions of a hypercycle and a path with at most two vertices in common. - Ewa Drgas-Burchardt; Elzbieta Sidorowicz (Discuss. Math. Graph Theory, 2020)

Equitable improper choosability of graphs. - Ewa Drgas-Burchardt; Hanna Furmanczyk; Elzbieta Sidorowicz (Theor. Comput. Sci., 2020)

Proper connection and proper-walk connection of digraphs. - Anna Fiedorowicz; Elzbieta Sidorowicz; Éric Sopena (Appl. Math. Comput., 2021)

Preface 2019. - Ewa Drgas-Burchardt; Elzbieta Sidorowicz (Discuss. Math. Graph Theory, 2021)

The neighbour sum distinguishing relaxed edge colouring. - Antoine Dailly; Éric Duchêne; Aline Parreau; Elzbieta Sidorowicz (Appl. Math. Comput., 2022)

Sum-list-colouring of θ-hypergraphs. - Ewa Drgas-Burchardt; Agata Drzystek; Elzbieta Sidorowicz (Ars Math. Contemp., 2022)

The neighbour sum distinguishing edge-weighting with local constraints. - Antoine Dailly; Elzbieta Sidorowicz (CoRR, 2022)

Neighbour sum distinguishing edge-weightings with local constraints. - Antoine Dailly; Elzbieta Sidorowicz (Discret. Appl. Math., 2023)

(Strong) Proper vertex connection of some digraphs. - Kairui Nie; Yingbin Ma; Elzbieta Sidorowicz (Appl. Math. Comput., 2023)

Hypergraph operations preserving sc-greediness. - Piotr Borowiecki; Ewa Drgas-Burchardt; Elzbieta Sidorowicz (Discuss. Math. Graph Theory, 2024)