| Publication | Date of Publication | Type |
|---|
One-to-one correspondence between interpretations of the Tutte polynomials
Journal of Combinatorial Theory. Series B | 2023-08-10 | Paper |
Interpretations for the Tutte polynomials of morphisms of matroids
Discrete Applied Mathematics | 2022-10-13 | Paper |
Polynomials counting nowhere-zero chains in graphs
The Electronic Journal of Combinatorics | 2022-02-01 | Paper |
Modifications of Tutte-Grothendieck invariants and Tutte polynomials
AKCE International Journal of Graphs and Combinatorics | 2021-10-05 | Paper |
Interpretations of the Tutte and characteristic polynomials of matroids
Journal of Algebraic Combinatorics | 2021-05-11 | Paper |
Bounds of characteristic polynomials of regular matroids
| 2021-02-11 | Paper |
Interpretations of the Tutte polynomials of regular matroids
Advances in Applied Mathematics | 2019-11-07 | Paper |
Equivalent versions of group-connectivity theorems and conjectures
Discrete Applied Mathematics | 2019-03-11 | Paper |
Three colorability characterized by shrinking of locally connected subgraphs into triangles
Information Processing Letters | 2018-04-05 | Paper |
Edge cut splitting formulas for Tutte-Grothendieck invariants
Journal of Combinatorial Theory. Series B | 2017-05-26 | Paper |
Polynomial algorithms for canonical forms of orientations
Journal of Combinatorial Optimization | 2016-02-23 | Paper |
scientific article; zbMATH DE number 6468926 (Why is no real title available?)
| 2015-08-03 | Paper |
Girth restrictions for the \(5\)-flow conjecture
| 2014-10-13 | Paper |
Linear algebraic approach to an edge-coloring result
Journal of Combinatorial Optimization | 2014-07-11 | Paper |
Matrix reduction in a combinatorial computation
Information Processing Letters | 2013-04-04 | Paper |
Non-extendible Latin parallelepipeds
Information Processing Letters | 2013-03-21 | Paper |
Brooks' theorem for generalized dart graphs
Information Processing Letters | 2012-05-04 | Paper |
Reductions of matrices associated with nowhere-zero flows
Lecture Notes in Computer Science | 2011-05-19 | Paper |
Dichotomy for coloring of dart graphs
Lecture Notes in Computer Science | 2011-05-19 | Paper |
Three measures of edge-uncolorability
Discrete Mathematics | 2011-01-07 | Paper |
Complexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surface
Discrete Applied Mathematics | 2010-11-05 | Paper |
Complexity of approximation of 3-edge-coloring of graphs
Information Processing Letters | 2010-06-09 | Paper |
Smallest counterexample to the 5-flow conjecture has girth at least eleven
Journal of Combinatorial Theory. Series B | 2010-06-03 | Paper |
Polyhedral embeddings of snarks in orientable surfaces
Proceedings of the American Mathematical Society | 2009-05-05 | Paper |
3-Regular Non 3-Edge-Colorable Graphs with Polyhedral Embeddings in Orientable Surfaces
Graph Drawing | 2009-03-03 | Paper |
Counting nowhere-zero flows on wheels
Discrete Mathematics | 2008-11-12 | Paper |
Approximation of 3-Edge-Coloring of Cubic Graphs
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
About Counterexamples to The 5-Flow Conjecture
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Nowhere-zero -flows on wheels
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Restrictions on smallest counterexamples to the 5-flow conjecture
Combinatorica | 2006-10-05 | Paper |
scientific article; zbMATH DE number 5036077 (Why is no real title available?)
| 2006-06-26 | Paper |
Experimental and Efficient Algorithms
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Edge-coloring of multigraphs
Discrete Mathematics | 2005-10-26 | Paper |
Decomposition formulas for the flow polynomial
European Journal of Combinatorics | 2005-09-29 | Paper |
scientific article; zbMATH DE number 2197947 (Why is no real title available?)
| 2005-08-23 | Paper |
A note on approximation of a ball by polytopes
Discrete Optimization | 2005-08-22 | Paper |
Covering planar graphs with forests
Journal of Combinatorial Theory. Series B | 2005-05-04 | Paper |
3-coloring and 3-clique-ordering of locally connected graphs
Journal of Algorithms | 2005-02-22 | Paper |
Colorability of planar graphs with isolated nontriangular faces
Graphs and Combinatorics | 2005-01-20 | Paper |
Reduction of the 5-flow conjecture to cyclically 6-edge-connected snarks.
Journal of Combinatorial Theory. Series B | 2004-03-15 | Paper |
Snarks and flow-snarks constructed from coloring-snarks.
Discrete Mathematics | 2004-03-14 | Paper |
Tension-flow polynomials on graphs
Discrete Mathematics | 2004-01-26 | Paper |
A theorem about elementary cuts and flow polynomials
Graphs and Combinatorics | 2003-10-16 | Paper |
The 3-Colorability Problem on Graphs with Maximum Degree Four
SIAM Journal on Computing | 2003-09-28 | Paper |
scientific article; zbMATH DE number 1982186 (Why is no real title available?)
| 2003-09-16 | Paper |
A note about the dominating circuit conjecture
Discrete Mathematics | 2003-03-16 | Paper |
Tension polynomials of graphs
Journal of Graph Theory | 2003-02-01 | Paper |
An equivalent version of the 3-flow conjecture
Journal of Combinatorial Theory. Series B | 2002-12-10 | Paper |
Polynomials associated with nowhere-zero flows
Journal of Combinatorial Theory. Series B | 2002-12-10 | Paper |
scientific article; zbMATH DE number 1817227 (Why is no real title available?)
| 2002-10-17 | Paper |
Superposition and constructions of graphs without nowhere-zero \(k\)-flows
European Journal of Combinatorics | 2002-09-04 | Paper |
Equivalences between Hamiltonicity and flow conjectures, and the sublinear defect property
Discrete Mathematics | 2002-08-29 | Paper |
Stable dominating circuits in snarks
Discrete Mathematics | 2002-06-03 | Paper |
Equivalence of Fleischner's and Thomassen's conjectures
Journal of Combinatorial Theory. Series B | 2000-06-25 | Paper |
scientific article; zbMATH DE number 1420705 (Why is no real title available?)
| 2000-03-22 | Paper |
scientific article; zbMATH DE number 1332111 (Why is no real title available?)
| 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
SIAM Journal on Discrete Mathematics | 1998-09-21 | Paper |
A cyclically 6-edge-connected snark of order 118
Discrete Mathematics | 1997-06-09 | Paper |
Symmetrized and continuous generalization of transversals
| 1997-04-17 | Paper |
Snarks without small cycles
Journal of Combinatorial Theory. Series B | 1997-01-26 | Paper |
scientific article; zbMATH DE number 822751 (Why is no real title available?)
| 1996-06-18 | Paper |
Five cycle double covers of some cubic graphs
Journal of Combinatorial Theory. Series B | 1995-07-04 | Paper |
Compatible systems of representatives
Discrete Mathematics | 1995-05-01 | Paper |
About a generalization of transversals
| 1994-10-26 | Paper |
scientific article; zbMATH DE number 566419 (Why is no real title available?)
| 1994-05-10 | Paper |
A note on the arboricity of graphs
Graphs and Combinatorics | 1993-04-01 | Paper |
The notion and basic properties of \(M\)-transversals
Discrete Mathematics | 1993-01-16 | Paper |
scientific article; zbMATH DE number 90559 (Why is no real title available?)
| 1993-01-16 | Paper |
Varieties of modular \(p\)-algebras not containing \(M_{3,3}\)
Algebra Universalis | 1992-06-27 | Paper |
scientific article; zbMATH DE number 25798 (Why is no real title available?)
| 1992-06-27 | Paper |
scientific article; zbMATH DE number 4122007 (Why is no real title available?)
| 1989-01-01 | Paper |
Efficient monotone circuits for threshold functions
Information Processing Letters | 1989-01-01 | Paper |
Construction of crossing-critical graphs
Discrete Mathematics | 1987-01-01 | Paper |
scientific article; zbMATH DE number 4002101 (Why is no real title available?)
| 1987-01-01 | Paper |
