default search action
Sylwia Cichacz
Person information
- affiliation: AGH University of Science and Technology, Faculty of Applied Mathematics, Krakow, Poland
- affiliation: University of Primorska, Faculty of Mathematics, Natural Sciences and Information Technologies, Koper, Slovenia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j53]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) - 2023
- [j52]Marcin Anholcer
On b-acyclic chromatic number of a graph. Comput. Appl. Math. 42(1) (2023) - [j51]Sylwia Cichacz
Zero-sum partitions of Abelian groups of order $2^n$. Discret. Math. Theor. Comput. Sci. 25 (2023) - 2022
- [j50]Sylwia Cichacz
On some graph-cordial Abelian groups. Discret. Math. 345(5): 112815 (2022) - [j49]Sylwia Cichacz
Realization of digraphs in Abelian groups and its consequences. J. Graph Theory 100(2): 331-345 (2022) - 2021
- [j48]Sylwia Cichacz
A magic rectangle set on Abelian groups and its application. Discret. Appl. Math. 288: 201-210 (2021) - [j47]Sylwia Cichacz
Minimum k-critical bipartite graphs. Discret. Appl. Math. 302: 54-66 (2021) - [j46]Marcin Anholcer
Group distance magic and antimagic hypercubes. Discret. Math. 344(12): 112625 (2021) - [j45]Sylwia Cichacz
Z2× Z2-cordial cycle-free hypergraphs. Discuss. Math. Graph Theory 41(4): 1021-1040 (2021) - [j44]Sylwia Cichacz
Upper Bounds on Inclusive Distance Vertex Irregularity Strength. Graphs Comb. 37(6): 2713-2721 (2021) - 2020
- [j43]Sylwia Cichacz
Group distance magic Cartesian product of two cycles. Discret. Math. 343(5): 111807 (2020) - [j42]Sylwia Cichacz
Modular Edge-Gracefulness of Graphs without Stars. Symmetry 12(12): 2013 (2020)
2010 – 2019
- 2019
- [j41]Marcin Anholcer
Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs. Appl. Math. Comput. 343: 149-155 (2019) - [j40]Marcin Anholcer
Note on the group edge irregularity strength of graphs. Appl. Math. Comput. 350: 237-241 (2019) - [j39]Sylwia Cichacz:
Corrigendum to: On zero sum-partition of Abelian groups into three sets and group distance magic labeling. Ars Math. Contemp. 16(2): 641 (2019) - [j38]Sylwia Cichacz
Orientable ℤn-distance magic graphs. Discuss. Math. Graph Theory 39(2): 533-546 (2019) - [i1]Sylwia Cichacz, Karol Suchan:
Vertex-Fault Tolerant Complete Matching in Bipartite graphs: the Biregular Case. CoRR abs/1907.04844 (2019) - 2018
- [j37]Sylwia Cichacz
2-swappable graphs. AKCE Int. J. Graphs Comb. 15(3): 242-250 (2018) - [j36]Sylwia Cichacz
Zero Sum Partition of Abelian Groups into Sets of the Same Order and its Applications. Electron. J. Comb. 25(1): 1 (2018) - [j35]Sylwia Cichacz
Constant sum partition of sets of integers and distance magic graphs. Discuss. Math. Graph Theory 38(1): 97-106 (2018) - [j34]Sylwia Cichacz
Group twin coloring of graphs. Discret. Math. Theor. Comput. Sci. 20(1) (2018) - 2017
- [j33]Sylwia Cichacz
On zero sum-partition of Abelian groups into three sets and group distance magic labeling. Ars Math. Contemp. 13(2): 417-425 (2017) - [j32]Marcin Anholcer, Sylwia Cichacz:
Group Irregular Labelings of Disconnected Graphs. Contributions Discret. Math. 12(2) (2017) - [j31]Sylwia Cichacz
Vertex magic total labelings of 2-regular graphs. Discret. Math. 340(1): 3117-3124 (2017) - [j30]Sylwia Cichacz
Union of distance magic graphs. Discuss. Math. Graph Theory 37(1): 239-249 (2017) - [j29]S. Arumugam
Preface. Electron. Notes Discret. Math. 60: 1 (2017) - 2016
- [j28]Sylwia Cichacz
Distance magic circulant graphs. Discret. Math. 339(1): 84-94 (2016) - [j27]Marcin Anholcer
Spectra of graphs and closed distance magic labelings. Discret. Math. 339(7): 1915-1923 (2016) - [j26]Sylwia Cichacz
Distance magic Cartesian product of graphs. Discuss. Math. Graph Theory 36(2): 299-308 (2016) - [j25]Marcin Anholcer
Group sum chromatic number of graphs. Eur. J. Comb. 55: 73-81 (2016) - 2015
- [j24]Marcin Anholcer
Group distance magic labeling of direct product of graphs. Ars Math. Contemp. 9(1): 93-107 (2015) - [j23]Sylwia Cichacz
Group distance magic and antimagic graphs. Electron. Notes Discret. Math. 48: 41-48 (2015) - [j22]Marcin Anholcer
Note on Distance Magic Products G ∘ C4. Graphs Comb. 31(5): 1117-1124 (2015) - [j21]Marcin Anholcer
Distance Magic Labeling and Two Products of Graphs. Graphs Comb. 31(5): 1125-1136 (2015) - [j20]Marcin Anholcer
Group irregularity strength of connected graphs. J. Comb. Optim. 30(1): 1-17 (2015) - 2014
- [j19]Sylwia Cichacz
Distance magic graphs G×Cn. Discret. Appl. Math. 177: 80-87 (2014) - [j18]Sylwia Cichacz
Note on Group Distance Magic Graphs G[C 4]. Graphs Comb. 30(3): 565-571 (2014) - [c2]Sylwia Cichacz
A \varGamma -magic Rectangle Set and Group Distance Magic Labeling. IWOCA 2014: 122-127 - 2013
- [j17]Sylwia Cichacz:
Group distance magic labeling of some cycle-related graphs. Australas. J Comb. 57: 235-244 (2013) - [j16]Sylwia Cichacz
Cordial labeling of hypertrees. Discret. Math. 313(22): 2518-2524 (2013) - [j15]Sylwia Cichacz
Decomposition of complete bipartite graphs into generalized prisms. Eur. J. Comb. 34(1): 104-110 (2013) - 2012
- [j14]Sylwia Cichacz
A lower bound on the size of (H; 1)-vertex stable graphs. Discret. Math. 312(20): 3026-3029 (2012) - 2011
- [j13]Sylwia Cichacz, Agnieszka Görlich, Malgorzata Zwonek, Andrzej Zak:
On (Cn;k) Stable Graphs. Electron. J. Comb. 18(1) (2011) - [j12]Sylwia Cichacz, Jakub Przybylo:
Irregular edge coloring of 2-regular graphs. Discret. Math. Theor. Comput. Sci. 13(1): 1-12 (2011) - 2010
- [j11]Sylwia Cichacz, Jakub Przybylo:
Vertex-distinquishing edge-colorings of linear forests. Discuss. Math. Graph Theory 30(1): 95-103 (2010) - [j10]Sylwia Cichacz
Edge-disjoint Open Trails in Complete Bipartite Multigraphs. Graphs Comb. 26(2): 207-214 (2010)
2000 – 2009
- 2009
- [j9]Sylwia Cichacz
Arbitrary decompositions into open and closed trails. Discret. Math. 309(6): 1511-1516 (2009) - [j8]Sylwia Cichacz
Decompositions of pseudographs into closed trails of even sizes. Discret. Math. 309(15): 4903-4908 (2009) - [j7]Sylwia Cichacz
Factorization of Kn, n into (0, j)-prisms. Inf. Process. Lett. 109(16): 932-934 (2009) - [c1]Sylwia Cichacz
Note on Decomposition of Kn, n into (0, j)-prisms. IWOCA 2009: 125-133 - 2008
- [j6]Sylwia Cichacz, Jakub Przybylo, Mariusz Wozniak:
Irregular edge-colorings of sums of cycles of even lengths. Australas. J Comb. 40: 41-56 (2008) - [j5]Sylwia Cichacz, Agnieszka Görlich:
The complete multigraphs and their decompositions into open trails. Australas. J Comb. 42: 159-164 (2008) - 2007
- [j4]Sylwia Cichacz:
Decomposition of complete bipartite digraphs and even complete multigraphs into closed trails. Discuss. Math. Graph Theory 27(2): 241-249 (2007) - 2006
- [j3]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) - [j2]Sylwia Cichacz, Irmina A. Ziolo:
On arbitraly vertex decomposable unicyclic graphs with dominating cycle. Discuss. Math. Graph Theory 26(3): 403-412 (2006) - [j1]Sylwia Cichacz
Decomposition of complete bipartite graphs into open trails. Electron. Notes Discret. Math. 24: 53-55 (2006)
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 01:16 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: