| Publication | Date of Publication | Type |
|---|
All group‐based latin squares possess near transversals Journal of Combinatorial Designs | 2024-01-31 | Paper |
| There are only a finite number of excluded minors for the class of bicircular matroids | 2021-02-04 | Paper |
The chromatic number of finite group Cayley tables The Electronic Journal of Combinatorics | 2019-03-15 | Paper |
The chromatic number of finite group Cayley tables The Electronic Journal of Combinatorics | 2019-03-15 | Paper |
On the bounds of Conway's thrackles Discrete & Computational Geometry | 2017-10-10 | Paper |
| $E$-restricted double traces | 2016-10-31 | Paper |
On the chromatic number of Latin square graphs Discrete Mathematics | 2016-07-05 | Paper |
Bicircular matroids are 3-colorable Discrete Mathematics | 2016-04-07 | Paper |
On Hilbert bases of cuts Discrete Mathematics | 2015-12-08 | Paper |
| Few Long Lists for Edge Choosability of Planar Cubic Graphs | 2012-10-30 | Paper |
Balancing covectors SIAM Journal on Discrete Mathematics | 2012-03-15 | Paper |
Silver cubes Graphs and Combinatorics | 2009-04-29 | Paper |
A generalization of Kneser's addition theorem Advances in Mathematics | 2009-03-20 | Paper |
Cayley sum graphs and eigenvalues of \((3,6)\)-fullerenes Journal of Combinatorial Theory. Series B | 2009-03-04 | Paper |
Circular Coloring the Plane SIAM Journal on Discrete Mathematics | 2008-05-22 | Paper |
Triangular embeddings of complete graphs from graceful labellings of paths Journal of Combinatorial Theory. Series B | 2007-10-10 | Paper |
A quadratic lower bound for subset sums Acta Arithmetica | 2007-09-20 | Paper |
Balanced Signings and the Chromatic Number of Oriented Matroids Combinatorics, Probability and Computing | 2007-07-30 | Paper |
| Eulerian and bipartite orientable matroids | 2007-06-28 | Paper |
Packing non-zero \(A\)-paths in group-labelled graphs Combinatorica | 2007-05-08 | Paper |
| scientific article; zbMATH DE number 5115930 (Why is no real title available?) | 2007-01-12 | Paper |
Algorithms and Computation Lecture Notes in Computer Science | 2006-11-14 | Paper |
Edge disjoint cycles through specified vertices Journal of Graph Theory | 2005-12-08 | Paper |
Coloring-flow duality of embedded graphs Transactions of the American Mathematical Society | 2005-07-26 | Paper |
Binary Gray codes with long bit runs The Electronic Journal of Combinatorics | 2003-09-24 | Paper |
Binary Gray codes with long bit runs The Electronic Journal of Combinatorics | 2003-09-24 | Paper |
The circular flow number of a 6-edge connected graph is less than four Combinatorica | 2003-02-18 | Paper |
High-girth graphs avoiding a minor are nearly bipartite Journal of Combinatorial Theory. Series B | 2002-12-10 | Paper |
Removable Circuits in Binary Matroids Combinatorics, Probability and Computing | 2000-06-04 | Paper |
| On (k,d)-colorings and fractional nowhere-zero flows | 1999-10-11 | Paper |
Matroids with the circuit cover property European Journal of Combinatorics | 1999-09-10 | Paper |
Flows, view obstructions, and the lonely runner Journal of Combinatorial Theory. Series B | 1999-04-19 | Paper |
Removable circuits in multigraphs Journal of Combinatorial Theory. Series B | 1998-12-02 | Paper |
List edge colourings of some 1-factorable multigraphs Combinatorica | 1997-04-13 | Paper |
| Graphs with the Circuit Cover Property | 1994-09-15 | Paper |
| scientific article; zbMATH DE number 475604 (Why is no real title available?) | 1994-01-06 | Paper |
Quantizers ad the worst case Euclidean traveling salesman problem Journal of Combinatorial Theory. Series B | 1990-01-01 | Paper |
Research problems Discrete Mathematics | 1990-01-01 | Paper |
Cycle double covers of graphs with Hamilton paths Journal of Combinatorial Theory. Series B | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4087600 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 3937198 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3902686 (Why is no real title available?) | 1985-01-01 | Paper |