Nicholas J. Cavenagh

Discret. Math., December, 2023

Mutually orthogonal cycle systems.

[BibT_eX]

[DOI]

Andrea C. Burgess

,

,

David A. Pike

Ars Math. Contemp., November, 2022

Maximal sets of mutually orthogonal frequency squares.

[BibT_eX]

[DOI]

,

Adam Mammoliti

,

Des. Codes Cryptogr., 2021

Globally simple Heffter arrays H(n;k) when k≡0, 3(mod4).

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2020

Mutually Orthogonal Binary Frequency Squares.

[BibT_eX]

[DOI]

,

,

,

Electron. J. Comb., 2020

The existence of square non-integer Heffter arrays.

[BibT_eX]

[DOI]

,

,

,

Ars Math. Contemp., 2019

Lower Bounds on the Sizes of Defining Sets in Full n-Latin Squares and Full Designs.

[BibT_eX]

[DOI]

Graphs Comb., 2018

Balanced diagonals in frequency squares.

[BibT_eX]

[DOI]

,

Adam Mammoliti

Discret. Math., 2018

Subcubic trades in Steiner triple systems.

[BibT_eX]

[DOI]

,

Terry S. Griggs

Discret. Math., 2017

Latin Squares with No Transversals.

[BibT_eX]

[DOI]

,

Electron. J. Comb., 2017

Orthogonal Trades in Complete Sets of MOLS.

[BibT_eX]

[DOI]

,

,

Fatih Demirkale

Electron. J. Comb., 2017

Critical Sets of Full n-Latin Squares.

[BibT_eX]

[DOI]

,

Vaipuna Raass

Graphs Comb., 2016

On the distances between Latin squares and the smallest defining set size.

[BibT_eX]

[DOI]

Reshma Ramadurai

,

Electron. Notes Discret. Math., 2016

Decomposing Graphs of High Minimum Degree into 4-Cycles.

[BibT_eX]

[DOI]

Darryn E. Bryant

,

J. Graph Theory, 2015

Decomposing Dense Bipartite Graphs into 4-Cycles.

[BibT_eX]

[DOI]

Electron. J. Comb., 2015

Maximal Partial Latin Cubes.

[BibT_eX]

[DOI]

Thomas Britz

,

,

Henrik Kragh Sørensen

Electron. J. Comb., 2015

On the chromatic index of Latin squares.

[BibT_eX]

[DOI]

,

Jaromy Kuhl

Contributions Discret. Math., 2015

Induced Subarrays of Latin Squares Without Repeated Symbols.

[BibT_eX]

[DOI]

R. Julian R. Abel

,

,

Jaromy Kuhl

Electron. J. Comb., 2013

Nonextendible Latin Cuboids.

[BibT_eX]

[DOI]

,

,

,

,

SIAM J. Discret. Math., 2012

Decomposing complete equipartite graphs into odd square-length cycles: Number of parts even.

[BibT_eX]

[DOI]

,

Discret. Math., 2012

Complete sets of metamorphoses: Twofold 4-cycle systems into twofold 6-cycle systems.

[BibT_eX]

[DOI]

,

,

Abdollah Khodkar

Discret. Math., 2012

Identifying flaws in the security of critical sets in latin squares via triangulations.

[BibT_eX]

[DOI]

,

,

,

,

Australas. J Comb., 2012

Multi-latin squares.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2011

Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2010

On the number of transversals in Cayley tables of cyclic groups.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2010

Decomposing Complete Equipartite Graphs into Short Odd Cycles.

[BibT_eX]

[DOI]

,

Electron. J. Comb., 2010

Avoidable Partial Latin Squares Of Order 4m+1.

[BibT_eX]

Ars Comb., 2010

On completing three cyclically generated transversals to a latin square.

[BibT_eX]

[DOI]

,

Carlo Hämäläinen

,

Adrian M. Nelson

Finite Fields Their Appl., 2009

Path and cycle decompositions of complete equipartite graphs: Four parts.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2009

The cycle structure of two rows in a random Latin square.

[BibT_eX]

[DOI]

,

Catherine S. Greenhill

,

Random Struct. Algorithms, 2008

Planar Eulerian triangulations are equivalent to spherical Latin bitrades.

[BibT_eX]

[DOI]

,

Petr Lisonek

J. Comb. Theory, Ser. A, 2008

Sparse Graphs which Decompose into Closed Trails of Arbitrary Lengths.

[BibT_eX]

[DOI]

,

Graphs Comb., 2008

Minimal homogeneous Steiner 2-(v, 3) trades.

[BibT_eX]

[DOI]

,

,

Emine Sule Yazici

Discret. Math., 2008

When is a partial Latin square uniquely completable, but not its completable product?

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2008

Latin bitrades derived from groups.

[BibT_eX]

[DOI]

,

,

Carlo Hämäläinen

Discret. Math., 2008

On The Spectrum Of Critical Sets In Back Circulant Latin Squares.

[BibT_eX]

,

,

Abdollah Khodkar

Ars Comb., 2007

Minimal homogeneous latin trades.

[BibT_eX]

[DOI]

,

,

Emine Sule Yazici

Discret. Math., 2006

Edge-Magic Group Labellings of Countable Graphs.

[BibT_eX]

[DOI]

,

Diana Combe

,

Adrian M. Nelson

Electron. J. Comb., 2006

A lower bound for the size of a critical set in the back circulant latin square.

[BibT_eX]

[DOI]

Australas. J Comb., 2006

3-Homogeneous latin trades.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2005

4-homogeneous latin trades.

[BibT_eX]

[DOI]

,

,

Australas. J Comb., 2005

On a generalization of the Oberwolfach problem.

[BibT_eX]

[DOI]

,

Saad I. El-Zanati

,

Abdollah Khodkar

,

Charles Vanden Eynden

J. Comb. Theory, Ser. A, 2004

Constructing and deconstructing latin trades.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2004

Latin Trade Algorithms and the Smallest Critical Set in a Latin Square.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2003

Further decompositions of complete tripartite graphs into 5-cycles.

[BibT_eX]

[DOI]

Discret. Math., 2002

A new bound on the size of the largest 2-critical set in a latin square.

[BibT_eX]

[DOI]

Australas. J Comb., 2002

Decompositions of Complete Multipartite Graphs into Cycles of Even Length.

[BibT_eX]

[DOI]

,

Graphs Comb., 2000

On decomposing complete tripartite graphs into 5-cycles.

[BibT_eX]

[DOI]

,

Australas. J Comb., 2000

Decompositions of complete tripartite graphs into k-cycles.

[BibT_eX]

[DOI]