Agnieszka Görlich

Orcid: 0000-0002-7198-0531

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

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

2021
Upper Bounds on Inclusive Distance Vertex Irregularity Strength.
Graphs Comb., 2021

<i>Z<sub>2</sub>× Z<sub>2</sub></i>-cordial cycle-free hypergraphs.
Discuss. Math. Graph Theory, 2021

2020
A note on packing two copies of a tree into a graph with small maximum degree.
Discret. Math., 2020

2018
Constant sum partition of sets of integers and distance magic graphs.
Discuss. Math. Graph Theory, 2018

2016
On Erdős-Sós Conjecture for Trees of Large Size.
Electron. J. Comb., 2016

2013
Cordial labeling of hypertrees.
Discret. Math., 2013

2012
Sparse graphs of girth at least five are packable.
Discret. Math., 2012

A lower bound on the size of (H; 1)-vertex stable graphs.
Discret. Math., 2012

2011
On <i>(C<sub>n</sub>;k)</i> Stable Graphs.
Electron. J. Comb., 2011

2010
On Packable Digraphs.
SIAM J. Discret. Math., 2010

Edge-disjoint Open Trails in Complete Bipartite Multigraphs.
Graphs Comb., 2010

A note on an embedding problem in transitive tournaments.
Discret. Math., 2010

2009
A Note on Packing Graphs Without Cycles of Length up to Five.
Electron. J. Comb., 2009

2008
The complete multigraphs and their decompositions into open trails.
Australas. J Comb., 2008

2007
Fixed-point-free embeddings of digraphs with small size.
Discret. Math., 2007

A note on decompositions of transitive tournaments.
Discret. Math., 2007

A note on decompositions of transitive tournaments II.
Australas. J Comb., 2007

2006
A Note on a Packing Problem in Transitive Tournaments.
Graphs Comb., 2006

Decomposition of complete bipartite graphs into open trails.
Electron. Notes Discret. Math., 2006

Arbitrarily vertex decomposable caterpillars with four or five leaves.
Discuss. Math. Graph Theory, 2006

2004
A note on embedding graphs without short cycles.
Discret. Math., 2004

2003
On cyclically embeddable (n, n)-graphs.
Discuss. Math. Graph Theory, 2003


  Loading...