| Publication | Date of Publication | Type |
|---|
A solution to small cases of the honeymoon Oberwolfach problem
JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing | 2026-02-12 | Paper |
The directed Oberwolfach problem with variable cycle lengths: a recursive construction
Journal of Combinatorial Designs | 2025-05-26 | Paper |
-covering k-hypergraphs are quasi-Eulerian
Discussiones Mathematicae. Graph Theory | 2025-05-12 | Paper |
Resolvable cycle decompositions of complete multigraphs and complete equipartite multigraphs via layering and detachment
Journal of Combinatorial Designs | 2024-02-05 | Paper |
On the directed Oberwolfach problem for complete symmetric equipartite digraphs and uniform‐length cycles
Journal of Combinatorial Designs | 2023-11-09 | Paper |
Covering hypergraphs are Eulerian
Journal of Graph Theory | 2023-10-05 | Paper |
| The directed Oberwolfach problem with variable cycle lengths: a recursive construction | 2023-09-21 | Paper |
Using edge cuts to find Euler tours and Euler families in hypergraphs
Discrete Mathematics | 2023-07-19 | Paper |
| $\ell$-covering $k$-hypergraphs are quasi-eulerian | 2021-01-26 | Paper |
| On the Directed Oberwolfach Problem with variable cycle lengths | 2020-09-18 | Paper |
On the honeymoon Oberwolfach problem
Journal of Combinatorial Designs | 2019-12-12 | Paper |
Connection and separation in hypergraphs
Theory and Applications of Graphs | 2019-07-22 | Paper |
On the spouse-loving variant of the Oberwolfach problem
Journal of Combinatorial Designs | 2019-07-19 | Paper |
| On the directed Oberwolfach Problem with equal cycle lengths: the odd case | 2019-01-30 | Paper |
On the directed Oberwolfach Problem with equal cycle lengths: the odd case
(available as arXiv preprint) | 2019-01-30 | Paper |
Spanning Euler tours and spanning Euler families in hypergraphs with particular vertex cuts
Discrete Mathematics | 2018-08-15 | Paper |
Quasi-Eulerian hypergraphs
The Electronic Journal of Combinatorics | 2017-09-08 | Paper |
Triple systems are Eulerian
Journal of Combinatorial Designs | 2017-05-26 | Paper |
| Eulerian properties of hypergraphs | 2016-08-02 | Paper |
Decomposing complete equipartite multigraphs into cycles of variable lengths: the amalgamation-detachment approach
Journal of Combinatorial Designs | 2016-05-06 | Paper |
On Sheehan's Conjecture for Graphs with Symmetry
Journal of Graph Theory | 2015-09-29 | Paper |
| Hypergraphs: connection and separation | 2015-04-16 | Paper |
On the directed Oberwolfach problem with equal cycle lengths
The Electronic Journal of Combinatorics | 2014-09-04 | Paper |
Computing transitive closure of bipolar weighted digraphs
Discrete Applied Mathematics | 2012-11-22 | Paper |
Closed trail decompositions of complete equipartite graphs
Journal of Combinatorial Designs | 2010-07-13 | Paper |
More on almost self-complementary graphs
Discrete Mathematics | 2009-06-23 | Paper |
The existence of regular self-complementary 3-uniform hypergraphs
Discrete Mathematics | 2009-04-09 | Paper |
Vertex-transitive self-complementary uniform hypergraphs
European Journal of Combinatorics | 2009-01-27 | Paper |
Brick assignments and homogeneously almost self-complementary graphs
Journal of Combinatorial Theory. Series B | 2009-01-21 | Paper |
A note on transitive permutation groups of degree twice a prime
Ars Mathematica Contemporanea | 2009-01-09 | Paper |
Self-complementary two-graphs and almost self-complementary double covers
European Journal of Combinatorics | 2007-07-27 | Paper |
Homogeneously almost self-complementary graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Mobility of vertex-transitive graphs
Discrete Mathematics | 2007-02-13 | Paper |
On almost self-complementary graphs
Discrete Mathematics | 2006-03-20 | Paper |
Brian Alspach and his work
Discrete Mathematics | 2005-10-10 | Paper |
Almost self-complementary circulant graphs.
Discrete Mathematics | 2004-03-14 | Paper |
Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles
Journal of Combinatorial Theory. Series A | 2003-07-30 | Paper |
Decomposition of the complete graph plus a 1‐factor into cycles of equal length
Journal of Combinatorial Designs | 2003-05-22 | Paper |
Cycle decompositions. III: Complete graphs and fixed length cycles.
Journal of Combinatorial Designs | 2002-10-17 | Paper |
On decomposing K_n -I into cycles of a fixed odd length
Discrete Mathematics | 2002-05-21 | Paper |
Half-transitivity of some metacirculants
Discrete Mathematics | 2000-11-02 | Paper |
On the problem of a matching orthogonal to a 2-factorization
Discrete Mathematics | 2000-09-15 | Paper |
