Sylwia Cichacz

Orcid: 0000-0002-7738-0924

Affiliations:
  • AGH University of Science and Technology, Faculty of Applied Mathematics, Krakow, Poland
  • University of Primorska, Faculty of Mathematics, Natural Sciences and Information Technologies, Koper, Slovenia


According to our database1, Sylwia Cichacz authored at least 55 papers between 2006 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
On b-acyclic chromatic number of a graph.
Comput. Appl. Math., February, 2023

Zero-sum partitions of Abelian groups of order $2^n$.
Discret. Math. Theor. Comput. Sci., 2023

2022
Realization of digraphs in Abelian groups and its consequences.
J. Graph Theory, 2022

On some graph-cordial Abelian groups.
Discret. Math., 2022

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

Group distance magic and antimagic hypercubes.
Discret. Math., 2021

Minimum k-critical bipartite graphs.
Discret. Appl. Math., 2021

A magic rectangle set on Abelian groups and its application.
Discret. Appl. Math., 2021

2020
Modular Edge-Gracefulness of Graphs without Stars.
Symmetry, 2020

Group distance magic Cartesian product of two cycles.
Discret. Math., 2020

2019
Orientable <i>ℤ<sub>n</sub></i>-distance magic graphs.
Discuss. Math. Graph Theory, 2019

Vertex-Fault Tolerant Complete Matching in Bipartite graphs: the Biregular Case.
CoRR, 2019

Corrigendum to: On zero sum-partition of Abelian groups into three sets and group distance magic labeling.
Ars Math. Contemp., 2019

Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs.
Appl. Math. Comput., 2019

Note on the group edge irregularity strength of graphs.
Appl. Math. Comput., 2019

2018
Group twin coloring of graphs.
Discret. Math. Theor. Comput. Sci., 2018

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

Zero Sum Partition of Abelian Groups into Sets of the Same Order and its Applications.
Electron. J. Comb., 2018

2-swappable graphs.
AKCE Int. J. Graphs Comb., 2018

2017
Preface.
Electron. Notes Discret. Math., 2017

Union of distance magic graphs.
Discuss. Math. Graph Theory, 2017

Vertex magic total labelings of 2-regular graphs.
Discret. Math., 2017

Group Irregular Labelings of Disconnected Graphs.
Contributions Discret. Math., 2017

On zero sum-partition of Abelian groups into three sets and group distance magic labeling.
Ars Math. Contemp., 2017

2016
Group sum chromatic number of graphs.
Eur. J. Comb., 2016

Distance magic Cartesian product of graphs.
Discuss. Math. Graph Theory, 2016

Distance magic circulant graphs.
Discret. Math., 2016

Spectra of graphs and closed distance magic labelings.
Discret. Math., 2016

2015
Group irregularity strength of connected graphs.
J. Comb. Optim., 2015

Distance Magic Labeling and Two Products of Graphs.
Graphs Comb., 2015

Note on Distance Magic Products G ∘ C<sub>4</sub>.
Graphs Comb., 2015

Group distance magic and antimagic graphs.
Electron. Notes Discret. Math., 2015

Group distance magic labeling of direct product of graphs.
Ars Math. Contemp., 2015

2014
Note on Group Distance Magic Graphs G[C 4].
Graphs Comb., 2014

Distance magic graphs G×C<sub>n</sub>.
Discret. Appl. Math., 2014

A \varGamma -magic Rectangle Set and Group Distance Magic Labeling.
Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

2013
Decomposition of complete bipartite graphs into generalized prisms.
Eur. J. Comb., 2013

Cordial labeling of hypertrees.
Discret. Math., 2013

Group distance magic labeling of some cycle-related graphs.
Australas. J Comb., 2013

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

2011
Irregular edge coloring of 2-regular graphs.
Discret. Math. Theor. Comput. Sci., 2011

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

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

Vertex-distinquishing edge-colorings of linear forests.
Discuss. Math. Graph Theory, 2010

2009
Factorization of K<sub>n, n</sub> into (0, j)-prisms.
Inf. Process. Lett., 2009

Decompositions of pseudographs into closed trails of even sizes.
Discret. Math., 2009

Arbitrary decompositions into open and closed trails.
Discret. Math., 2009

Note on Decomposition of <i>K</i><sub><i>n</i>, <i>n</i></sub> into (0, <i>j</i>)-prisms.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2008
Irregular edge-colorings of sums of cycles of even lengths.
Australas. J Comb., 2008

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

2007
Decomposition of complete bipartite digraphs and even complete multigraphs into closed trails.
Discuss. Math. Graph Theory, 2007

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

On arbitraly vertex decomposable unicyclic graphs with dominating cycle.
Discuss. Math. Graph Theory, 2006

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


  Loading...