Construction of crossing-critical graphs. - Martin Kochol (Discret. Math., 1987)

Efficient monotone circuits for threshold functions. - Martin Kochol (Inf. Process. Lett., 1989)

The notion and basic properties of M-transversals. - Martin Kochol (Discret. Math., 1992)

A note on the arboricity of graphs. - Martin Kochol (Graphs Comb., 1992)

Compatible systems of representatives. - Martin Kochol (Discret. Math., 1994)

Relatively narrow latin parallelpipeds that cannot be extended to a latin cube. - Martin Kochol (Ars Comb., 1995)

Five Cycle Double Covers of Some Cubic Graphs. - Andreas Huck; Martin Kochol (J. Comb. Theory B, 1995)

A cyclically 6-edge-connected snark of order 118. - Martin Kochol (Discret. Math., 1996)

Snarks without Small Cycles. - Martin Kochol (J. Comb. Theory B, 1996)

Hypothetical complexity of the nowhere-zero 5-flow problem. - Martin Kochol (J. Graph Theory, 1998)

Partial Intersection Theorem and Flows in Abstract Networks. - Martin Kochol (SIAM J. Discret. Math., 1998)

Equivalence of Fleischner's and Thomassen's Conjectures. - Martin Kochol (J. Comb. Theory B, 2000)

Stable dominating circuits in snarks. - Martin Kochol (Discret. Math., 2001)

An Equivalent Version of the 3-Flow Conjecture. - Martin Kochol (J. Comb. Theory B, 2001)

A note about the dominating circuit conjecture. - Herbert Fleischner; Martin Kochol (Discret. Math., 2002)

Equivalences between hamiltonicity and flow conjectures, and the sublinear defect property. - Martin Kochol (Discret. Math., 2002)

Superposition and Constructions of Graphs Without Nowhere-zero k-flows. - Martin Kochol (Eur. J. Comb., 2002)

Polynomials Associated with Nowhere-Zero Flows. - Martin Kochol (J. Comb. Theory B, 2002)

Tension polynomials of graphs. - Martin Kochol (J. Graph Theory, 2002)

Linear Algorithm for 3-Coloring of Locally Connected Graphs. - Martin Kochol (WEA, 2003)

On Bases of the Cycle and Cut Spaces in Digraphs. - Martin Kochol (Ars Comb., 2003)

A Theorem About Elementary Cuts and Flow Polynomials. - Martin Kochol (Graphs Comb., 2003)

The 3-Colorability Problem on Graphs with Maximum Degree Four. - Martin Kochol; Vadim V. Lozin; Bert Randerath (SIAM J. Comput., 2003)

Constructions Of Graphs Without Nowhere-Zero Flows From Boolean Formulas. - Martin Kochol (Ars Comb., 2004)

A note on approximation of a ball by polytopes. - Martin Kochol (Discret. Optim., 2004)

Snarks and flow-snarks constructed from coloring-snarks. - Martin Kochol (Discret. Math., 2004)

Tension-flow polynomials on graphs. - Martin Kochol (Discret. Math., 2004)

Colorability of Planar Graphs with Isolated Nontriangular Faces. - Mark N. Ellingham; Herbert Fleischner; Martin Kochol; Emanuel Wenger (Graphs Comb., 2004)

Reduction of the 5-Flow Conjecture to cyclically 6-edge-connected snarks. - Martin Kochol (J. Comb. Theory B, 2004)

Girth restrictions for the 5-flow conjecture. - Martin Kochol (SODA, 2005)

Approximation Algorithm for Chromatic Index and Edge-Coloring of Multigraphs. - Martin Kochol; Nad'a Krivonáková; Silvia Smejová (WEA, 2005)

Edge-coloring of multigraphs. - Martin Kochol; Nad'a Krivonáková; Silvia Smejová (Discret. Math., 2005)

Decomposition formulas for the flow polynomial. - Martin Kochol (Eur. J. Comb., 2005)

About Counterexamples to The 5-Flow Conjecture. - Martin Kochol (Electron. Notes Discret. Math., 2005)

3-coloring and 3-clique-ordering of locally connected graphs: . - Martin Kochol (J. Algorithms, 2005)

Covering planar graphs with forests. - József Balogh; Martin Kochol; András Pluhár; Xingxing Yu (J. Comb. Theory B, 2005)

Restrictions On Smallest Counterexamples To The 5-Flow Conjecture. - Martin Kochol (Comb., 2006)

Reductions of matrices associated with nowhere-zero flows. - Martin Kochol; Nad'a Krivonáková; Silvia Smejová; Katarína Sranková (LATA, 2007)

Approximation of 3-Edge-Coloring of Cubic Graphs. - Martin Kochol; Nad'a Krivonáková; Silvia Smejová; Katarína Sranková (Electron. Notes Discret. Math., 2007)

Nowhere-zero I-flows on wheels. - Martin Kochol; Nad'a Krivonáková; Silvia Smejová; Katarína Sranková (Electron. Notes Discret. Math., 2007)

3-Regular Non 3-Edge-Colorable Graphs with Polyhedral Embeddings in Orientable Surfaces. - Martin Kochol (GD, 2008)

Counting nowhere-zero flows on wheels. - Martin Kochol; Nad'a Krivonáková; Silvia Smejová; Katarína Sranková (Discret. Math., 2008)

Complexity of approximation of 3-edge-coloring of graphs. - Martin Kochol; Nad'a Krivonáková; Silvia Smejová; Katarína Sranková (Inf. Process. Lett., 2008)

Flows in Graphs and Related Problems - Nowhere-Zero Flows, Cycle Covers, and Combinatorial Optimization. - Martin Kochol (LAP Lambert Academic Publishing, 2010)

Dichotomy for Coloring of Dart Graphs. - Martin Kochol; Riste Skrekovski (IWOCA, 2010)

Complexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surface. - Martin Kochol (Discret. Appl. Math., 2010)

Smallest counterexample to the 5-flow conjecture has girth at least eleven. - Martin Kochol (J. Comb. Theory B, 2010)

Decomposition of Tutte Polynomial. - Martin Kochol (CTW, 2011)

Coefficients of chromatic polynomials and tension polynomials. - Martin Kochol; Nad'a Krivonáková (Contributions Discret. Math., 2011)

Three measures of edge-uncolorability. - Martin Kochol (Discret. Math., 2011)

Matrix reduction in a combinatorial computation. - Martin Kochol; Nad'a Krivonáková; Silvia Smejová; Katarína Sranková (Inf. Process. Lett., 2011)

Non-extendible latin parallelepipeds. - Martin Kochol (Inf. Process. Lett., 2012)

Brooksʼ Theorem for generalized dart graphs. - Martin Kochol; Riste Skrekovski (Inf. Process. Lett., 2012)

Linear algebraic approach to an edge-coloring result. - Martin Kochol (J. Comb. Optim., 2014)

Polynomial algorithms for canonical forms of orientations. - Martin Kochol (J. Comb. Optim., 2016)

Edge cut splitting formulas for Tutte-Grothendieck invariants. - Martin Kochol (J. Comb. Theory B, 2017)

Three colorability characterized by shrinking of locally connected subgraphs into triangles. - Martin Kochol (Inf. Process. Lett., 2018)

Interpretations of the Tutte polynomials of regular matroids. - Martin Kochol (Adv. Appl. Math., 2019)

Equivalent versions of group-connectivity theorems and conjectures. - Martin Kochol (Discret. Appl. Math., 2019)

Modifications of Tutte-Grothendieck invariants and Tutte polynomials. - Martin Kochol (AKCE Int. J. Graphs Comb., 2020)

Bounds of characteristic polynomials of regular matroids. - Martin Kochol (Contributions Discret. Math., 2020)

Polynomials Counting Nowhere-Zero Chains in Graphs. - Martin Kochol (Electron. J. Comb., 2022)

Interpretations for the Tutte polynomials of morphisms of matroids. - Martin Kochol (Discret. Appl. Math., 2022)

One-to-one correspondence between interpretations of the Tutte polynomials. - Martin Kochol (J. Comb. Theory B, 2023)