We stand with Ukraine  

Agnieszka Görlich

Orcid: 0000-0002-7198-0531

According to our database1, Agnieszka Görlich authored at least 23 papers between 2003 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
<i>k</i>-fault-tolerant graphs for <i>p</i> disjoint complete graphs of order <i>c</i>.
[BibTeX]
[DOI]
Sylwia Cichacz
,
Agnieszka Görlich
,
Karol Suchan
Discuss. Math. Graph Theory, 2024

2021
Upper Bounds on Inclusive Distance Vertex Irregularity Strength.
[BibTeX]
[DOI]
Sylwia Cichacz
,
Agnieszka Görlich
,
Andrea Semanicová-Fenovcíková
Graphs Comb., 2021

<i>Z<sub>2</sub>× Z<sub>2</sub></i>-cordial cycle-free hypergraphs.
[BibTeX]
[DOI]
Sylwia Cichacz
,
Agnieszka Görlich
,
Zsolt Tuza
Discuss. Math. Graph Theory, 2021

2020
A note on packing two copies of a tree into a graph with small maximum degree.
[BibTeX]
[DOI]
Agnieszka Görlich
,
Mariusz Wozniak
Discret. Math., 2020

2018
Constant sum partition of sets of integers and distance magic graphs.
[BibTeX]
[DOI]
Sylwia Cichacz
,
Agnieszka Görlich
Discuss. Math. Graph Theory, 2018

2016
On Erdős-Sós Conjecture for Trees of Large Size.
[BibTeX]
[DOI]
Agnieszka Görlich
,
Andrzej Zak
Electron. J. Comb., 2016

2013
Cordial labeling of hypertrees.
[BibTeX]
[DOI]
Sylwia Cichacz
,
Agnieszka Görlich
,
Zsolt Tuza
Discret. Math., 2013

2012
Sparse graphs of girth at least five are packable.
[BibTeX]
[DOI]
Agnieszka Görlich
,
Andrzej Zak
Discret. Math., 2012

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

2011
On <i>(C<sub>n</sub>;k)</i> Stable Graphs.
[BibTeX]
[DOI]
Sylwia Cichacz
,
Agnieszka Görlich
,
Malgorzata Zwonek
,
Andrzej Zak
Electron. J. Comb., 2011

2010
On Packable Digraphs.
[BibTeX]
[DOI]
Agnieszka Görlich
,
Andrzej Zak
SIAM J. Discret. Math., 2010

Edge-disjoint Open Trails in Complete Bipartite Multigraphs.
[BibTeX]
[DOI]
Sylwia Cichacz
,
Agnieszka Görlich
Graphs Comb., 2010

A note on an embedding problem in transitive tournaments.
[BibTeX]
[DOI]
Agnieszka Görlich
,
Monika Pilsniak
Discret. Math., 2010

2009
A Note on Packing Graphs Without Cycles of Length up to Five.
[BibTeX]
[DOI]
Agnieszka Görlich
,
Andrzej Zak
Electron. J. Comb., 2009

2008
The complete multigraphs and their decompositions into open trails.
[BibTeX]
[DOI]
Sylwia Cichacz
,
Agnieszka Görlich
Australas. J Comb., 2008

2007
Fixed-point-free embeddings of digraphs with small size.
[BibTeX]
[DOI]
Agnieszka Görlich
,
Monika Pilsniak
,
Mariusz Wozniak
,
Irmina A. Ziolo
Discret. Math., 2007

A note on decompositions of transitive tournaments.
[BibTeX]
[DOI]
Agnieszka Görlich
,
Rafal Kalinowski
,
Mariusz Meszka
,
Monika Pilsniak
,
Mariusz Wozniak
Discret. Math., 2007

A note on decompositions of transitive tournaments II.
[BibTeX]
[DOI]
Agnieszka Görlich
,
Rafal Kalinowski
,
Mariusz Meszka
,
Monika Pilsniak
,
Mariusz Wozniak
Australas. J Comb., 2007

2006
A Note on a Packing Problem in Transitive Tournaments.
[BibTeX]
[DOI]
Agnieszka Görlich
,
Monika Pilsniak
,
Mariusz Wozniak
Graphs Comb., 2006

Decomposition of complete bipartite graphs into open trails.
[BibTeX]
[DOI]
Sylwia Cichacz
,
Agnieszka Görlich
Electron. Notes Discret. Math., 2006

Arbitrarily vertex decomposable caterpillars with four or five leaves.
[BibTeX]
[DOI]
Sylwia Cichacz
,
Agnieszka Görlich
,
Antoni Marczyk
,
Jakub Przybylo
,
Mariusz Wozniak
Discuss. Math. Graph Theory, 2006

2004
A note on embedding graphs without short cycles.
[BibTeX]
[DOI]
Agnieszka Görlich
,
Monika Pilsniak
,
Mariusz Wozniak
,
Irmina A. Ziolo
Discret. Math., 2004

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


  Loading...