default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAgnieszka Görlich
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j23]Sylwia Cichacz
, Agnieszka Görlich, Karol Suchan:
k-fault-tolerant graphs for p disjoint complete graphs of order c. Discuss. Math. Graph Theory 44(4): 1471-1484 (2024)- 2021
- [j22]Sylwia Cichacz, Agnieszka Görlich, Zsolt Tuza:
Z2× Z2-cordial cycle-free hypergraphs. Discuss. Math. Graph Theory 41(4): 1021-1040 (2021) - [j21]Sylwia Cichacz, Agnieszka Görlich, Andrea Semanicová-Fenovcíková:
Upper Bounds on Inclusive Distance Vertex Irregularity Strength. Graphs Comb. 37(6): 2713-2721 (2021) - 2020
- [j20]Agnieszka Görlich, Mariusz Wozniak:
A note on packing two copies of a tree into a graph with small maximum degree. Discret. Math. 343(10): 111991 (2020)
2010 – 2019
- 2018
- [j19]Sylwia Cichacz, Agnieszka Görlich:
Constant sum partition of sets of integers and distance magic graphs. Discuss. Math. Graph Theory 38(1): 97-106 (2018) - 2016
- [j18]Agnieszka Görlich, Andrzej Zak:
On Erdős-Sós Conjecture for Trees of Large Size. Electron. J. Comb. 23(1): 1 (2016) - 2013
- [j17]Sylwia Cichacz, Agnieszka Görlich, Zsolt Tuza:
Cordial labeling of hypertrees. Discret. Math. 313(22): 2518-2524 (2013) - 2012
- [j16]Sylwia Cichacz, Agnieszka Görlich, Mateusz Nikodem, Andrzej Zak:
A lower bound on the size of (H; 1)-vertex stable graphs. Discret. Math. 312(20): 3026-3029 (2012) - [j15]Agnieszka Görlich, Andrzej Zak:
Sparse graphs of girth at least five are packable. Discret. Math. 312(24): 3606-3613 (2012) - 2011
- [j14]Sylwia Cichacz, Agnieszka Görlich, Malgorzata Zwonek, Andrzej Zak:
On (Cn;k) Stable Graphs. Electron. J. Comb. 18(1) (2011) - 2010
- [j13]Agnieszka Görlich, Monika Pilsniak:
A note on an embedding problem in transitive tournaments. Discret. Math. 310(4): 681-686 (2010) - [j12]Sylwia Cichacz, Agnieszka Görlich:
Edge-disjoint Open Trails in Complete Bipartite Multigraphs. Graphs Comb. 26(2): 207-214 (2010) - [j11]Agnieszka Görlich, Andrzej Zak:
On Packable Digraphs. SIAM J. Discret. Math. 24(2): 552-557 (2010)
2000 – 2009
- 2009
- [j10]Agnieszka Görlich, Andrzej Zak:
A Note on Packing Graphs Without Cycles of Length up to Five. Electron. J. Comb. 16(1) (2009) - 2008
- [j9]Sylwia Cichacz, Agnieszka Görlich:
The complete multigraphs and their decompositions into open trails. Australas. J Comb. 42: 159-164 (2008) - 2007
- [j8]Agnieszka Görlich, Rafal Kalinowski, Mariusz Meszka, Monika Pilsniak, Mariusz Wozniak:
A note on decompositions of transitive tournaments II. Australas. J Comb. 37: 57-66 (2007) - [j7]Agnieszka Görlich, Rafal Kalinowski, Mariusz Meszka, Monika Pilsniak, Mariusz Wozniak:
A note on decompositions of transitive tournaments. Discret. Math. 307(7-8): 896-904 (2007) - [j6]Agnieszka Görlich, Monika Pilsniak, Mariusz Wozniak, Irmina A. Ziolo:
Fixed-point-free embeddings of digraphs with small size. Discret. Math. 307(11-12): 1332-1340 (2007) - 2006
- [j5]Sylwia Cichacz, Agnieszka Görlich, Antoni Marczyk, Jakub Przybylo, Mariusz Wozniak:
Arbitrarily vertex decomposable caterpillars with four or five leaves. Discuss. Math. Graph Theory 26(2): 291-305 (2006) - [j4]Sylwia Cichacz, Agnieszka Görlich:
Decomposition of complete bipartite graphs into open trails. Electron. Notes Discret. Math. 24: 53-55 (2006) - [j3]Agnieszka Görlich, Monika Pilsniak, Mariusz Wozniak:
A Note on a Packing Problem in Transitive Tournaments. Graphs Comb. 22(2): 233-239 (2006) - 2004
- [j2]Agnieszka Görlich, Monika Pilsniak, Mariusz Wozniak, Irmina A. Ziolo:
A note on embedding graphs without short cycles. Discret. Math. 286(1-2): 75-77 (2004) - 2003
- [j1]Agnieszka Görlich, Monika Pilsniak, Mariusz Wozniak:
On cyclically embeddable (n, n)-graphs. Discuss. Math. Graph Theory 23(1): 85-104 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 02:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
