Anita Pasotti

Orcid: 0000-0002-3569-2954

According to our database1, Anita Pasotti authored at least 27 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Weak Heffter Arrays and Biembedding Graphs on Non-Orientable Surfaces.
Electron. J. Comb., 2024

2022
Non-zero sum Heffter arrays and their applications.
Discret. Math., 2022

Growable realizations: a powerful approach to the Buratti-Horak-Rosa Conjecture.
Ars Math. Contemp., 2022

2021
On λ-fold relative Heffter arrays and biembedding multigraphs on surfaces.
Eur. J. Comb., 2021

New methods to attack the Buratti-Horak-Rosa conjecture.
Discret. Math., 2021

2020
Relative Heffter arrays and biembeddings.
Ars Math. Contemp., 2020

A tour problem on a toroidal board.
Australas. J Comb., 2020

2018
Cyclic Uniform 2-Factorizations of the Complete Multipartite Graph.
Graphs Comb., 2018

A problem on partial sums in abelian groups.
Discret. Math., 2018

2017
Cyclic and symmetric hamiltonian cycle systems of the complete multipartite graph: even number of parts.
Ars Math. Contemp., 2017

2016
A Generalization of the Problem of Mariusz Meszka.
Graphs Comb., 2016

2015
<i>α</i>-labelings of a class of generalized Petersen graphs.
Discuss. Math. Graph Theory, 2015

2014
A new result on the problem of Buratti, Horak and Rosa.
Discret. Math., 2014

On the Buratti-Horak-Rosa Conjecture about Hamiltonian Paths in Complete Graphs.
Electron. J. Comb., 2014

Decompositions of complete multipartite graphs via generalized graceful labelings.
Australas. J Comb., 2014

2013
Decompositions into generalized Petersen graphs via graceful labelings.
Electron. Notes Discret. Math., 2013

Decompositions of graphs via generalized graceful labelings.
Electron. Notes Discret. Math., 2013

On optimal (v, 5, 2, 1) optical orthogonal codes.
Des. Codes Cryptogr., 2013

On d-graceful labelings.
Ars Comb., 2013

2012
Sampling complete designs.
Discret. Math., 2012

2011
New results on optimal (<i>v</i>, 4, 2, 1) optical orthogonal codes.
Des. Codes Cryptogr., 2011

2010
Symmetric 1-factorizations of the complete graph.
Eur. J. Comb., 2010

Constructions for cyclic Moebius ladder systems.
Discret. Math., 2010

Further progress on difference families with block size 4 or 5.
Des. Codes Cryptogr., 2010

2009
On the Existence of Elementary Abelian Cycle Systems.
Graphs Comb., 2009

Combinatorial designs and the theorem of Weil on multiplicative character sums.
Finite Fields Their Appl., 2009

2008
On equidistance graphs.
Australas. J Comb., 2008


  Loading...