Agnieszka Görlich - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 22 from 22

2021

Upper Bounds on Inclusive Distance Vertex Irregularity StrengthSylwia Cichacz, Agnieszka Görlich, Andrea Semanicová-Fenovcíková. gc, 37(6):2713-2721, 2021. [doi]

2-cordial cycle-free hypergraphsSylwia Cichacz, Agnieszka Görlich, Zsolt Tuza. dmgt, 41(4):1021-1040, 2021. [doi]

2020

A note on packing two copies of a tree into a graph with small maximum degreeAgnieszka Görlich, Mariusz Wozniak. DM, 343(10):111991, 2020. [doi]

2018

Constant sum partition of sets of integers and distance magic graphsSylwia Cichacz, Agnieszka Görlich. dmgt, 38(1):97-106, 2018. [doi]

2016

On Erdős-Sós Conjecture for Trees of Large SizeAgnieszka Görlich, Andrzej Zak. combinatorics, 23(1):1, 2016. [doi]

2013

Cordial labeling of hypertreesSylwia Cichacz, Agnieszka Görlich, Zsolt Tuza. DM, 313(22):2518-2524, 2013. [doi]

2012

A lower bound on the size of (H; 1)-vertex stable graphsSylwia Cichacz, Agnieszka Görlich, Mateusz Nikodem, Andrzej Zak. DM, 312(20):3026-3029, 2012. [doi]

Sparse graphs of girth at least five are packableAgnieszka Görlich, Andrzej Zak. DM, 312(24):3606-3613, 2012. [doi]

2011

n;k) Stable GraphsSylwia Cichacz, Agnieszka Görlich, Malgorzata Zwonek, Andrzej Zak. combinatorics, 18(1), 2011. [doi]

2010

Edge-disjoint Open Trails in Complete Bipartite MultigraphsSylwia Cichacz, Agnieszka Görlich. gc, 26(2):207-214, 2010. [doi]

A note on an embedding problem in transitive tournamentsAgnieszka Görlich, Monika Pilsniak. DM, 310(4):681-686, 2010. [doi]

On Packable DigraphsAgnieszka Görlich, Andrzej Zak. siamdm, 24(2):552-557, 2010. [doi]

2009

A Note on Packing Graphs Without Cycles of Length up to FiveAgnieszka Görlich, Andrzej Zak. combinatorics, 16(1), 2009. [doi]

2008

The complete multigraphs and their decompositions into open trailsSylwia Cichacz, Agnieszka Görlich. ajc, 42:159-164, 2008. [doi]

2007

Fixed-point-free embeddings of digraphs with small sizeAgnieszka Görlich, Monika Pilsniak, Mariusz Wozniak, Irmina A. Ziolo. DM, 307(11-12):1332-1340, 2007. [doi]

A note on decompositions of transitive tournaments IIAgnieszka Görlich, Rafal Kalinowski, Mariusz Meszka, Monika Pilsniak, Mariusz Wozniak. ajc, 37:57-66, 2007. [doi]

A note on decompositions of transitive tournamentsAgnieszka Görlich, Rafal Kalinowski, Mariusz Meszka, Monika Pilsniak, Mariusz Wozniak. DM, 307(7-8):896-904, 2007. [doi]

2006

Decomposition of complete bipartite graphs into open trailsSylwia Cichacz, Agnieszka Görlich. endm, 24:53-55, 2006. [doi]

Arbitrarily vertex decomposable caterpillars with four or five leavesSylwia Cichacz, Agnieszka Görlich, Antoni Marczyk, Jakub Przybylo, Mariusz Wozniak. dmgt, 26(2):291-305, 2006. [doi]

A Note on a Packing Problem in Transitive TournamentsAgnieszka Görlich, Monika Pilsniak, Mariusz Wozniak. gc, 22(2):233-239, 2006. [doi]

2004

A note on embedding graphs without short cyclesAgnieszka Görlich, Monika Pilsniak, Mariusz Wozniak, Irmina A. Ziolo. DM, 286(1-2):75-77, 2004. [doi]

2003

On cyclically embeddable (n, n)-graphsAgnieszka Görlich, Monika Pilsniak, Mariusz Wozniak. dmgt, 23(1):85-104, 2003. [doi]

Sign in or sign up to see more results.

runs on WebDSL