| Publication | Date of Publication | Type |
|---|
| Bounded‐excess flows in cubic graphs | 2022-03-31 | Paper |
| Flows and Bisections in Cubic Graphs | 2017-09-26 | Paper |
| The structure of graphs with circular flow number 5 or more, and the complexity of their recognition problem | 2016-05-25 | Paper |
| Short cycle covers of graphs and nowhere-zero flows | 2011-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576695 | 2010-07-30 | Paper |
| Greedily constructing maximal partial \(f\)-factors | 2009-06-19 | Paper |
| Some results on \((a:b)\)-choosability | 2009-06-19 | Paper |
| Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests | 2007-05-23 | Paper |
| Multigraph decomposition into stars and into multistars | 2005-08-17 | Paper |
| On some multigraph decomposition problems and their computational complexity | 2004-08-06 | Paper |
| On (k,d)-colorings and fractional nowhere-zero flows | 1999-10-11 | Paper |
| The graph polynomial and the number of proper vertex colorings | 1999-07-12 | Paper |
| Flows, view obstructions, and the lonely runner | 1999-04-19 | Paper |
| A note on graph colorings and graph polynomials | 1998-02-22 | Paper |
| Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture | 1998-02-10 | Paper |
| The structure of well-covered graphs and the complexity of their recognition problems | 1997-10-26 | Paper |
| Graphs where every maximal path is maximum | 1997-04-21 | Paper |
| Well-covered claw-free graphs | 1997-03-23 | Paper |
| Recognizing Greedy Structures | 1996-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4201584 | 1993-08-25 | Paper |
| Short cycle covers and the cycle double cover conjecture | 1993-03-10 | Paper |
| Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties | 1993-03-10 | Paper |
| Colorings and orientations of graphs | 1993-01-16 | Paper |
| NP-completeness of graph decomposition problems | 1992-06-26 | Paper |
| A nowhere-zero point in linear mappings | 1989-01-01 | Paper |
| Interpolation between bases and the shuffle exchange network | 1989-01-01 | Paper |
| Matroidal bijections between graphs | 1988-01-01 | Paper |
| Short circuit covers for regular matroids with a nowhere zero 5-flow | 1987-01-01 | Paper |
| Structuring causal trees | 1986-01-01 | Paper |
| Semi-duality and the cycle double cover conjecture | 1986-01-01 | Paper |
| Deciding hypergraph 2-colourability by H-resolution | 1985-01-01 | Paper |
| Nowhere zero flow and circuit covering in regular matroids | 1985-01-01 | Paper |
| Covering Multigraphs by Simple Circuits | 1985-01-01 | Paper |
| Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs | 1983-01-01 | Paper |
| Optimal Search on Some Game Trees | 1983-01-01 | Paper |
| The Counterfeit Coin Problem Revisited | 1982-01-01 | Paper |
| On the decomposition of a graph into stars | 1981-01-01 | Paper |
| Decomposition of complete multigraphs into stars | 1979-01-01 | Paper |
