| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6200549 | 2024-03-22 | Paper |
| On the Maximum Size of a Prefix Code | 2024-03-19 | Paper |
| Remembering Professor Štefan Znám, 9.2.1936--17.7.1993 | 2023-11-16 | Paper |
| Connected cubic graphs with the maximum number of perfect matchings | 2023-10-05 | Paper |
| Keller's Conjecture Revisited | 2022-12-02 | Paper |
| Characterization of Basic 5-Value Spectrum Functions Through Walsh-Hadamard Transform | 2021-02-24 | Paper |
| 50 Years of the Golomb--Welch Conjecture | 2018-07-09 | Paper |
| A combinatorial problem related to sparse systems of equations | 2017-09-15 | Paper |
| Fast decoding of quasi-perfect Lee distance codes | 2017-06-08 | Paper |
| On a mnemonic construction of permutations | 2017-03-16 | Paper |
| An application of combinatorics in cryptography | 2016-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5740780 | 2016-07-20 | Paper |
| Algebraic Method in Tilings | 2016-02-29 | Paper |
| Partitioning ℝ<sup><em>n</em></sup> into Connected Components | 2015-11-05 | Paper |
| Speeding up deciphering by hypergraph ordering | 2015-03-30 | Paper |
| On graphs with many cycles | 2014-08-08 | Paper |
| Tiling \(\mathbb R^5\) by crosses | 2014-07-04 | Paper |
| A generalization of Lee codes | 2014-02-25 | Paper |
| A new approach towards the Golomb-Welch conjecture | 2014-02-10 | Paper |
| On quasigroups with few associative triples | 2012-05-22 | Paper |
| Non-periodic tilings of \({\mathbb{R}}^{n}\) by crosses | 2012-03-02 | Paper |
| On hamiltonian cycles in the prism over the odd graphs | 2011-11-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5392831 | 2011-04-14 | Paper |
| Error-correcting codes and Minkowski’s conjecture | 2010-10-14 | Paper |
| On complexity of round transformations | 2009-12-15 | Paper |
| On perfect Lee codes | 2009-12-15 | Paper |
| Enumerating and decoding perfect linear Lee codes | 2009-10-14 | Paper |
| Equitable specialized block-colourings for Steiner triple systems | 2009-04-29 | Paper |
| On a problem of Marco Buratti | 2009-04-07 | Paper |
| Tilings in Lee metric | 2009-03-04 | Paper |
| On covering vertices of a graph by trees | 2008-09-04 | Paper |
| Completing Latin squares: Critical sets II | 2007-01-24 | Paper |
| Fast decoding of quasi-perfect Lee distance codes | 2006-11-22 | Paper |
| The prism over the middle-levels graph is Hamiltonian | 2006-05-02 | Paper |
| On the chromatic number of Steiner triple systems of order 25 | 2005-10-10 | Paper |
| Extended Petersen graphs | 2005-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5461520 | 2005-07-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3156235 | 2005-01-06 | Paper |
| The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors | 2004-08-20 | Paper |
| On non-polynomial Latin squares | 2004-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4457555 | 2004-03-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4798527 | 2003-06-16 | Paper |
| Completing Latin squares: Critical sets | 2003-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3147272 | 2003-03-18 | Paper |
| Some applications of graph theory to other parts of mathematics. | 2001-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4873224 | 2001-11-13 | Paper |
| The train marshalling problem | 2001-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4503093 | 2001-05-28 | Paper |
| A lower bound on the number of hamiltonian cycles | 2001-03-30 | Paper |
| Partitioning infinite trees | 2000-12-28 | Paper |
| An Optimization Problem in Statistical Databases | 2000-07-20 | Paper |
| Hamilton cycles in block-intersection graphs of triple systems | 2000-04-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4940040 | 2000-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4940076 | 2000-03-01 | Paper |
| On the strong chromatic index of cyclic multigraphs | 2000-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4261766 | 1999-09-12 | Paper |
| A small embedding for partial even-cycle systems | 1999-08-10 | Paper |
| Minimal oriented graphs of diameter 2 | 1999-08-02 | Paper |
| A combinatorial problem in database security | 1999-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4342772 | 1998-01-05 | Paper |
| Kirkman's school projects | 1997-10-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4351079 | 1997-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3127638 | 1997-05-28 | Paper |
| Decomposing 4-Regular Graphs into Triangle-Free 2-Factors | 1997-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4865527 | 1996-02-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4849060 | 1996-01-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4838454 | 1995-07-12 | Paper |
| On a matrix partition conjecture | 1995-04-05 | Paper |
| Isomorphic factorizations of trees | 1995-03-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4320685 | 1995-02-02 | Paper |
| Local and global average degree in graphs and multigraphs | 1994-11-30 | Paper |
| Euler's Theorem | 1994-07-10 | Paper |
| Large \(s\)-representable set systems with low maximum degree | 1994-05-24 | Paper |
| Induced matchings in cubic graphs | 1994-05-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3137967 | 1994-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3136993 | 1993-11-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4014314 | 1992-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3988520 | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3983253 | 1992-06-27 | Paper |
| Extending partial systems of distinct representatives | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3972005 | 1992-06-25 | Paper |
| Erratum volume 50, number 2 (1990): Peter Horák, ``A coloring problem related to the Erdős-Faber-Lovász conjecture, pp. 321-322 | 1991-01-01 | Paper |
| Solution of two problems of P. Erdős concerning Hamiltonian cycles | 1990-01-01 | Paper |
| A coloring problem related to the Erdős, Faber, Lovasz conjecture | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3201075 | 1990-01-01 | Paper |
| On Alspach's conjecture | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4205447 | 1989-01-01 | Paper |
| Subgraphs intersecting any Hamiltonian cycle | 1988-01-01 | Paper |
| A construction of thickness-minimal graphs | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3798657 | 1987-01-01 | Paper |
| On a construction of Thomassen | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3039352 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3665133 | 1983-01-01 | Paper |
| Latin parallelepipeds and cubes | 1982-01-01 | Paper |
| On a Modified Concept of Thickness of a Graph | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3340901 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3950580 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3953795 | 1982-01-01 | Paper |
| Generalized uniformly line vulnerable digraphs | 1982-01-01 | Paper |
| Note on a new coloring number of a graph | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4184861 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4184867 | 1979-01-01 | Paper |
