| Publication | Date of Publication | Type |
|---|
Bounded-excess flows in cubic graphs
Journal of Graph Theory | 2022-03-31 | Paper |
Flows and bisections in cubic graphs
Journal of Graph Theory | 2017-09-26 | Paper |
The structure of graphs with circular flow number 5 or more, and the complexity of their recognition problem
Journal of Combinatorics | 2016-05-25 | Paper |
Short cycle covers of graphs and nowhere-zero flows
Journal of Graph Theory | 2011-12-20 | Paper |
Multigraph decomposition into multigraphs with two underlying edges
| 2010-07-30 | Paper |
Some results on \((a:b)\)-choosability
Discrete Mathematics | 2009-06-19 | Paper |
Greedily constructing maximal partial \(f\)-factors
Discrete Mathematics | 2009-06-19 | Paper |
Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests
Discrete Mathematics | 2007-05-23 | Paper |
Multigraph decomposition into stars and into multistars
Discrete Mathematics | 2005-08-17 | Paper |
On some multigraph decomposition problems and their computational complexity
Discrete Mathematics | 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
Annales de l’institut Fourier | 1999-07-12 | Paper |
Flows, view obstructions, and the lonely runner
Journal of Combinatorial Theory. Series B | 1999-04-19 | Paper |
A note on graph colorings and graph polynomials
Journal of Combinatorial Theory. Series B | 1998-02-22 | Paper |
Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
SIAM Journal on Computing | 1998-02-10 | Paper |
The structure of well-covered graphs and the complexity of their recognition problems
Journal of Combinatorial Theory. Series B | 1997-10-26 | Paper |
Graphs where every maximal path is maximum
Journal of Combinatorial Theory. Series B | 1997-04-21 | Paper |
Well-covered claw-free graphs
Journal of Combinatorial Theory. Series B | 1997-03-23 | Paper |
Recognizing Greedy Structures
Journal of Algorithms | 1996-02-20 | Paper |
scientific article; zbMATH DE number 398969 (Why is no real title available?)
| 1993-08-25 | Paper |
Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
Journal of Combinatorial Theory. Series B | 1993-03-10 | Paper |
Short cycle covers and the cycle double cover conjecture
Journal of Combinatorial Theory. Series B | 1993-03-10 | Paper |
Colorings and orientations of graphs
Combinatorica | 1993-01-16 | Paper |
NP-completeness of graph decomposition problems
Journal of Complexity | 1992-06-26 | Paper |
A nowhere-zero point in linear mappings
Combinatorica | 1989-01-01 | Paper |
Interpolation between bases and the shuffle exchange network
European Journal of Combinatorics | 1989-01-01 | Paper |
Matroidal bijections between graphs
Journal of Combinatorial Theory. Series B | 1988-01-01 | Paper |
Short circuit covers for regular matroids with a nowhere zero 5-flow
Journal of Combinatorial Theory. Series B | 1987-01-01 | Paper |
Structuring causal trees
Journal of Complexity | 1986-01-01 | Paper |
Semi-duality and the cycle double cover conjecture
Journal of Combinatorial Theory. Series B | 1986-01-01 | Paper |
Covering Multigraphs by Simple Circuits
SIAM Journal on Algebraic Discrete Methods | 1985-01-01 | Paper |
Deciding hypergraph 2-colourability by H-resolution
Theoretical Computer Science | 1985-01-01 | Paper |
Nowhere zero flow and circuit covering in regular matroids
Journal of Combinatorial Theory. Series B | 1985-01-01 | Paper |
Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
Journal of Combinatorial Theory. Series A | 1983-01-01 | Paper |
Optimal Search on Some Game Trees
Journal of the ACM | 1983-01-01 | Paper |
The Counterfeit Coin Problem Revisited
SIAM Journal on Computing | 1982-01-01 | Paper |
On the decomposition of a graph into stars
Discrete Mathematics | 1981-01-01 | Paper |
Decomposition of complete multigraphs into stars
Discrete Mathematics | 1979-01-01 | Paper |
