Anita Pasotti

Finite Fields Their Appl., 2024

The seating couples problem in the even case.

[BibT_eX]

[DOI]

Mariusz Meszka

Discret. Math., 2024

Weak Heffter Arrays and Biembedding Graphs on Non-Orientable Surfaces.

[BibT_eX]

[DOI]

Lorenzo Mella

Electron. J. Comb., 2024

On the number of non-isomorphic (simple) k-gonal biembeddings of complete multipartite graphs.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2024

2022

Non-zero sum Heffter arrays and their applications.

[BibT_eX]

[DOI]

Stefano Della Fiore

Discret. Math., 2022

Growable realizations: a powerful approach to the Buratti-Horak-Rosa Conjecture.

[BibT_eX]

[DOI]

M. A. Ollis

John R. Schmitt

Ars Math. Contemp., 2022

2021

On λ-fold relative Heffter arrays and biembedding multigraphs on surfaces.

[BibT_eX]

[DOI]

Eur. J. Comb., 2021

New methods to attack the Buratti-Horak-Rosa conjecture.

[BibT_eX]

[DOI]

M. A. Ollis

John R. Schmitt

Discret. Math., 2021

2020

Relative Heffter arrays and biembeddings.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2020

A tour problem on a toroidal board.

[BibT_eX]

[DOI]

Marco Dalai

Australas. J Comb., 2020

2018

Cyclic Uniform 2-Factorizations of the Complete Multipartite Graph.

[BibT_eX]

[DOI]

Graphs Comb., 2018

A problem on partial sums in abelian groups.

[BibT_eX]

[DOI]

Fiorenza Morini

Discret. Math., 2018

2017

Cyclic and symmetric hamiltonian cycle systems of the complete multipartite graph: even number of parts.

[BibT_eX]

[DOI]

Francesca Merola

Ars Math. Contemp., 2017

2016

A Generalization of the Problem of Mariusz Meszka.

[BibT_eX]

[DOI]

Graphs Comb., 2016

2015

<i>α</i>-labelings of a class of generalized Petersen graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2015

2014

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

[BibT_eX]

[DOI]

Discret. Math., 2014

On the Buratti-Horak-Rosa Conjecture about Hamiltonian Paths in Complete Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2014

Decompositions of complete multipartite graphs via generalized graceful labelings.

[BibT_eX]

[DOI]

Australas. J Comb., 2014

2013

Decompositions into generalized Petersen graphs via graceful labelings.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

Decompositions of graphs via generalized graceful labelings.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

On optimal (v, 5, 2, 1) optical orthogonal codes.

[BibT_eX]

[DOI]

Dianhua Wu

Des. Codes Cryptogr., 2013

On d-graceful labelings.

[BibT_eX]

Ars Comb., 2013

2012

Sampling complete designs.

[BibT_eX]

[DOI]

Luca Giuzzi

Discret. Math., 2012

2011

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

[BibT_eX]

[DOI]

Koji Momihara

Des. Codes Cryptogr., 2011

2010

Symmetric 1-factorizations of the complete graph.

[BibT_eX]

[DOI]

Eur. J. Comb., 2010

Constructions for cyclic Moebius ladder systems.

[BibT_eX]

[DOI]

Discret. Math., 2010

Further progress on difference families with block size 4 or 5.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2010

2009

On the Existence of Elementary Abelian Cycle Systems.

[BibT_eX]

[DOI]

Graphs Comb., 2009

Combinatorial designs and the theorem of Weil on multiplicative character sums.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2009

2008

On equidistance graphs.

[BibT_eX]

[DOI]