| Publication | Date of Publication | Type |
|---|
| One-to-one correspondence between interpretations of the Tutte polynomials | 2023-08-10 | Paper |
| Interpretations for the Tutte polynomials of morphisms of matroids | 2022-10-13 | Paper |
| Polynomials counting nowhere-zero chains in graphs | 2022-02-01 | Paper |
| Modifications of Tutte–Grothendieck invariants and Tutte polynomials | 2021-10-05 | Paper |
| Interpretations of the Tutte and characteristic polynomials of matroids | 2021-05-11 | Paper |
| Bounds of characteristic polynomials of regular matroids | 2021-02-11 | Paper |
| Interpretations of the Tutte polynomials of regular matroids | 2019-11-07 | Paper |
| Equivalent versions of group-connectivity theorems and conjectures | 2019-03-11 | Paper |
| Three colorability characterized by shrinking of locally connected subgraphs into triangles | 2018-04-05 | Paper |
| Edge cut splitting formulas for Tutte-Grothendieck invariants | 2017-05-26 | Paper |
| Polynomial algorithms for canonical forms of orientations | 2016-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501209 | 2015-08-03 | Paper |
| Girth restrictions for the \(5\)-flow conjecture | 2014-10-13 | Paper |
| Linear algebraic approach to an edge-coloring result | 2014-07-11 | Paper |
| Matrix reduction in a combinatorial computation | 2013-04-04 | Paper |
| Non-extendible Latin parallelepipeds | 2013-03-21 | Paper |
| Brooks' theorem for generalized dart graphs | 2012-05-04 | Paper |
| Reductions of Matrices Associated with Nowhere-Zero Flows | 2011-05-19 | Paper |
| Dichotomy for Coloring of Dart Graphs | 2011-05-19 | Paper |
| Three measures of edge-uncolorability | 2011-01-07 | Paper |
| Complexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surface | 2010-11-05 | Paper |
| Complexity of approximation of 3-edge-coloring of graphs | 2010-06-09 | Paper |
| Smallest counterexample to the 5-flow conjecture has girth at least eleven | 2010-06-03 | Paper |
| Polyhedral embeddings of snarks in orientable surfaces | 2009-05-05 | Paper |
| 3-Regular Non 3-Edge-Colorable Graphs with Polyhedral Embeddings in Orientable Surfaces | 2009-03-03 | Paper |
| Counting nowhere-zero flows on wheels | 2008-11-12 | Paper |
| Approximation of 3-Edge-Coloring of Cubic Graphs | 2008-06-05 | Paper |
| About Counterexamples to The 5-Flow Conjecture | 2007-05-29 | Paper |
| Nowhere-zero -flows on wheels | 2007-05-29 | Paper |
| Restrictions on smallest counterexamples to the 5-flow conjecture | 2006-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5475534 | 2006-06-26 | Paper |
| Experimental and Efficient Algorithms | 2005-11-30 | Paper |
| Edge-coloring of multigraphs | 2005-10-26 | Paper |
| Decomposition formulas for the flow polynomial | 2005-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5466091 | 2005-08-23 | Paper |
| A note on approximation of a ball by polytopes | 2005-08-22 | Paper |
| Covering planar graphs with forests | 2005-05-04 | Paper |
| 3-coloring and 3-clique-ordering of locally connected graphs | 2005-02-22 | Paper |
| Colorability of planar graphs with isolated nontriangular faces | 2005-01-20 | Paper |
| Reduction of the 5-flow conjecture to cyclically 6-edge-connected snarks. | 2004-03-15 | Paper |
| Snarks and flow-snarks constructed from coloring-snarks. | 2004-03-14 | Paper |
| Tension-flow polynomials on graphs | 2004-01-26 | Paper |
| A theorem about elementary cuts and flow polynomials | 2003-10-16 | Paper |
| The 3-Colorability Problem on Graphs with Maximum Degree Four | 2003-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4426355 | 2003-09-16 | Paper |
| A note about the dominating circuit conjecture | 2003-03-16 | Paper |
| Tension polynomials of graphs | 2003-02-01 | Paper |
| An equivalent version of the 3-flow conjecture | 2002-12-10 | Paper |
| Polynomials associated with nowhere-zero flows | 2002-12-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3150349 | 2002-10-17 | Paper |
| Superposition and constructions of graphs without nowhere-zero \(k\)-flows | 2002-09-04 | Paper |
| Equivalences between Hamiltonicity and flow conjectures, and the sublinear defect property | 2002-08-29 | Paper |
| Stable dominating circuits in snarks | 2002-06-03 | Paper |
| Equivalence of Fleischner's and Thomassen's conjectures | 2000-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944757 | 2000-03-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4261777 | 1999-09-12 | Paper |
| Hypothetical complexity of the nowhere-zero 5-flow problem | 1999-05-11 | Paper |
| Partial Intersection Theorem and Flows in Abstract Networks | 1998-09-21 | Paper |
| A cyclically 6-edge-connected snark of order 118 | 1997-06-09 | Paper |
| Symmetrized and continuous generalization of transversals | 1997-04-17 | Paper |
| Snarks without small cycles | 1997-01-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4856630 | 1996-06-18 | Paper |
| Five cycle double covers of some cubic graphs | 1995-07-04 | Paper |
| Compatible systems of representatives | 1995-05-01 | Paper |
| About a generalization of transversals | 1994-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4291532 | 1994-05-10 | Paper |
| A note on the arboricity of graphs | 1993-04-01 | Paper |
| The notion and basic properties of \(M\)-transversals | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4018731 | 1993-01-16 | Paper |
| Varieties of modular \(p\)-algebras not containing \(M_{3,3}\) | 1992-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3984187 | 1992-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4735200 | 1989-01-01 | Paper |
| Efficient monotone circuits for threshold functions | 1989-01-01 | Paper |
| Construction of crossing-critical graphs | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3754624 | 1987-01-01 | Paper |
