On cyclically embeddable (n, n)-graphs. - Agnieszka Görlich; Monika Pilsniak; Mariusz Wozniak (Discuss. Math. Graph Theory, 2003)

A note on embedding graphs without short cycles. - Agnieszka Görlich; Monika Pilsniak; Mariusz Wozniak; Irmina A. Ziolo (Discret. Math., 2004)

Arbitrarily vertex decomposable caterpillars with four or five leaves. - Sylwia Cichacz; Agnieszka Görlich; Antoni Marczyk; Jakub Przybylo; Mariusz Wozniak (Discuss. Math. Graph Theory, 2006)

Decomposition of complete bipartite graphs into open trails. - Sylwia Cichacz; Agnieszka Görlich (Electron. Notes Discret. Math., 2006)

A Note on a Packing Problem in Transitive Tournaments. - Agnieszka Görlich; Monika Pilsniak; Mariusz Wozniak (Graphs Comb., 2006)

A note on decompositions of transitive tournaments II. - Agnieszka Görlich; Rafal Kalinowski; Mariusz Meszka; Monika Pilsniak; Mariusz Wozniak (Australas. J Comb., 2007)

A note on decompositions of transitive tournaments. - Agnieszka Görlich; Rafal Kalinowski; Mariusz Meszka; Monika Pilsniak; Mariusz Wozniak (Discret. Math., 2007)

Fixed-point-free embeddings of digraphs with small size. - Agnieszka Görlich; Monika Pilsniak; Mariusz Wozniak; Irmina A. Ziolo (Discret. Math., 2007)

The complete multigraphs and their decompositions into open trails. - Sylwia Cichacz; Agnieszka Görlich (Australas. J Comb., 2008)

A Note on Packing Graphs Without Cycles of Length up to Five. - Agnieszka Görlich; Andrzej Zak (Electron. J. Comb., 2009)

A note on an embedding problem in transitive tournaments. - Agnieszka Görlich; Monika Pilsniak (Discret. Math., 2010)

Edge-disjoint Open Trails in Complete Bipartite Multigraphs. - Sylwia Cichacz; Agnieszka Görlich (Graphs Comb., 2010)

On Packable Digraphs. - Agnieszka Görlich; Andrzej Zak (SIAM J. Discret. Math., 2010)

On (Cn;k) Stable Graphs. - Sylwia Cichacz; Agnieszka Görlich; Malgorzata Zwonek; Andrzej Zak (Electron. J. Comb., 2011)

A lower bound on the size of (H; 1)-vertex stable graphs. - Sylwia Cichacz; Agnieszka Görlich; Mateusz Nikodem; Andrzej Zak (Discret. Math., 2012)

Sparse graphs of girth at least five are packable. - Agnieszka Görlich; Andrzej Zak (Discret. Math., 2012)

Cordial labeling of hypertrees. - Sylwia Cichacz; Agnieszka Görlich; Zsolt Tuza (Discret. Math., 2013)

On Erdős-Sós Conjecture for Trees of Large Size. - Agnieszka Görlich; Andrzej Zak (Electron. J. Comb., 2016)

Constant sum partition of sets of integers and distance magic graphs. - Sylwia Cichacz; Agnieszka Görlich (Discuss. Math. Graph Theory, 2018)

A note on packing two copies of a tree into a graph with small maximum degree. - Agnieszka Görlich; Mariusz Wozniak (Discret. Math., 2020)

Z2× Z2-cordial cycle-free hypergraphs. - Sylwia Cichacz; Agnieszka Görlich; Zsolt Tuza (Discuss. Math. Graph Theory, 2021)

Upper Bounds on Inclusive Distance Vertex Irregularity Strength. - Sylwia Cichacz; Agnieszka Görlich; Andrea Semanicová-Fenovcíková (Graphs Comb., 2021)

k-fault-tolerant graphs for p disjoint complete graphs of order c. - Sylwia Cichacz; Agnieszka Görlich; Karol Suchan (Discuss. Math. Graph Theory, 2024)