| Publication | Date of Publication | Type |
|---|
Ryser's theorem for symmetric \(\rho\)-Latin squares
Combinatorial Theory | 2026-03-09 | Paper |
Completing multi-Latin rectangles via factors with prescribed degrees in bipartite graphs
Journal of Combinatorial Designs | 2025-12-29 | Paper |
Ryser's theorem for simple multi-Latin rectangles
Designs, Codes and Cryptography | 2025-12-02 | Paper |
Toward a three-dimensional counterpart of Cruse's theorem
Proceedings of the American Mathematical Society | 2024-04-23 | Paper |
Resolvable cycle decompositions of complete multigraphs and complete equipartite multigraphs via layering and detachment
Journal of Combinatorial Designs | 2024-02-05 | Paper |
Symmetric Layer-Rainbow Colorations of Cubes
SIAM Journal on Discrete Mathematics | 2023-11-29 | Paper |
| Ryser Type Conditions for Extending Colorings of Triples | 2022-09-19 | Paper |
| Embedding Irregular Colorings into Connected Factorizations | 2022-09-14 | Paper |
| On Layer-Rainbow Latin Cubes Containing Layer-Rainbow Latin Cubes | 2022-09-14 | Paper |
| Ryser's Theorem for Symmetric $\rho$-latin Squares | 2022-09-13 | Paper |
Ryser's theorem for \(\rho\)-Latin rectangles
Journal of Combinatorial Theory. Series A | 2022-06-13 | Paper |
Embedding connected factorizations
Journal of Combinatorial Theory. Series B | 2022-04-27 | Paper |
| On Factors with Prescribed Degrees in Bipartite Graphs | 2022-03-23 | Paper |
On regular set systems containing regular subsystems
European Journal of Combinatorics | 2021-09-02 | Paper |
| Connected Fair Detachments of Hypergraphs | 2020-09-21 | Paper |
Extending regular edge-colorings of complete hypergraphs
Journal of Graph Theory | 2020-05-21 | Paper |
Extending factorizations of complete uniform hypergraphs
Combinatorica | 2019-05-23 | Paper |
Extending edge-colorings of complete hypergraphs into regular colorings
Journal of Graph Theory | 2019-04-25 | Paper |
Partitioning the edge set of a hypergraph into almost regular cycles
Journal of Combinatorial Designs | 2018-11-23 | Paper |
| What are graph amalgamations? | 2017-10-10 | Paper |
Quasi-Eulerian hypergraphs
The Electronic Journal of Combinatorics | 2017-09-08 | Paper |
Factorizations of complete multipartite hypergraphs
Discrete Mathematics | 2016-12-14 | Paper |
| Eulerian properties of hypergraphs | 2016-08-02 | Paper |
Embedding factorizations for 3-uniform hypergraphs II: \(r\)-factorizations into \(s\)-factorizations
The Electronic Journal of Combinatorics | 2016-06-01 | Paper |
Decomposing complete equipartite multigraphs into cycles of variable lengths: the amalgamation-detachment approach
Journal of Combinatorial Designs | 2016-05-06 | Paper |
| Hypergraphs: connection and separation | 2015-04-16 | Paper |
Connected Baranyai's theorem
Combinatorica | 2014-08-14 | Paper |
Embedding an edge-colored \(K(a^{(p)};\lambda,\mu)\) into a Hamiltonian decomposition of \(K(a^{(p+r)};\lambda,\mu)\)
Graphs and Combinatorics | 2013-07-19 | Paper |
Embedding factorizations for 3-uniform hypergraphs
Journal of Graph Theory | 2013-05-21 | Paper |
Detachments of amalgamated 3-uniform hypergraphs: factorization consequences
Journal of Combinatorial Designs | 2013-02-21 | Paper |
Detachments of hypergraphs I: The Berge-Johnson problem
Combinatorics, Probability and Computing | 2012-09-04 | Paper |
Multiply balanced edge colorings of multigraphs
Journal of Graph Theory | 2012-07-10 | Paper |
Spanning Euler Tours in Hypergraphs
(available as arXiv preprint) | N/A | Paper |
