Partitions of some planar graphs into two linear forests. - Piotr Borowiecki; Mariusz Haluszczak (Discuss. Math. Graph Theory, 1997)

On the completeness of decomposable properties of graphs. - Mariusz Haluszczak; Pavol Vateha (Discuss. Math. Graph Theory, 1999)

Minimal reducible bounds for 1-nonouterplanar graphs. - Mieczyslaw Borowiecki; Mariusz Haluszczak; Miroslawa Skowronska (Discret. Math., 2000)

Nonrepetitive colorings of graphs. - Noga Alon; Jaroslaw Grytczuk; Mariusz Haluszczak; Oliver Riordan (Random Struct. Algorithms, 2002)

Schütte's Tournament Problem and Intersecting Families of Sets. - Mieczyslaw Borowiecki; Jaroslaw Grytczuk; Mariusz Haluszczak; Zsolt Tuza (Comb. Probab. Comput., 2003)

On-line Ramsey Theory. - Jaroslaw Grytczuk; Mariusz Haluszczak; Henry A. Kierstead (Electron. J. Comb., 2004)

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

About acyclic edge colourings of planar graphs. - Anna Fiedorowicz; Mariusz Haluszczak; Narayanan Narayanan (Inf. Process. Lett., 2008)

Acyclic reducible bounds for outerplanar graphs. - Mieczyslaw Borowiecki; Anna Fiedorowicz; Mariusz Haluszczak (Discuss. Math. Graph Theory, 2009)

Minimal forbidden graphs of reducible additive hereditary graph properties. - Ewa Drgas-Burchardt; Mariusz Haluszczak; Peter Mihók (Ars Comb., 2010)

On Ramsey (K1, 2, Kn)-minimal graphs. - Mariusz Haluszczak (Discuss. Math. Graph Theory, 2012)

Acyclic chromatic indices of fully subdivided graphs. - Anna Fiedorowicz; Mariusz Haluszczak (Inf. Process. Lett., 2012)

On Ramsey (K1, m, G)(K1, m, G)-minimal graphs. - Marta Borowiecka-Olszewska; Mariusz Haluszczak (Discret. Math., 2013)

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

On the structure and deficiency of k-trees with bounded degree. - Marta Borowiecka-Olszewska; Ewa Drgas-Burchardt; Mariusz Haluszczak (Discret. Appl. Math., 2016)