Martin Kochol

Publication Activity (10 Years)

Years Active: 1987-2023
Publications (10 Years): 10

Top Topics

Confidence Bounds

Connected Subgraphs

Implicit Polynomial

Independent Set

Top Venues

J. Comb. Optim.

Discret. Appl. Math.

J. Comb. Theory, Ser. B

Electron. J. Comb.

Publications

Martin Kochol
One-to-one correspondence between interpretations of the Tutte polynomials. J. Comb. Theory, Ser. B 162 (2023)
Martin Kochol
Polynomials Counting Nowhere-Zero Chains in Graphs. Electron. J. Comb. 29 (1) (2022)
Martin Kochol
Interpretations for the Tutte polynomials of morphisms of matroids. Discret. Appl. Math. 322 (2022)
Martin Kochol
Bounds of characteristic polynomials of regular matroids. Contributions Discret. Math. 15 (3) (2020)
Martin Kochol
Modifications of Tutte-Grothendieck invariants and Tutte polynomials. AKCE Int. J. Graphs Comb. 17 (1) (2020)
Martin Kochol
Interpretations of the Tutte polynomials of regular matroids. Adv. Appl. Math. 111 (2019)
Martin Kochol
Equivalent versions of group-connectivity theorems and conjectures. Discret. Appl. Math. 257 (2019)
Martin Kochol
Three colorability characterized by shrinking of locally connected subgraphs into triangles. Inf. Process. Lett. 135 (2018)
Martin Kochol
Edge cut splitting formulas for Tutte-Grothendieck invariants. J. Comb. Theory, Ser. B 125 (2017)
Martin Kochol
Polynomial algorithms for canonical forms of orientations. J. Comb. Optim. 31 (1) (2016)
Martin Kochol
Linear algebraic approach to an edge-coloring result. J. Comb. Optim. 28 (2) (2014)
Martin Kochol, Riste Skrekovski
Brooksʼ Theorem for generalized dart graphs. Inf. Process. Lett. 112 (5) (2012)
Martin Kochol
Non-extendible latin parallelepipeds. Inf. Process. Lett. 112 (24) (2012)
Martin Kochol
Decomposition of Tutte Polynomial. CTW (2011)
Martin Kochol
Three measures of edge-uncolorability. Discret. Math. 311 (1) (2011)
Martin Kochol, Nad'a Krivonáková, Silvia Smejová, Katarína Sranková
Matrix reduction in a combinatorial computation. Inf. Process. Lett. 111 (4) (2011)
Martin Kochol, Nad'a Krivonáková
Coefficients of chromatic polynomials and tension polynomials. Contributions Discret. Math. 6 (1) (2011)
Martin Kochol, Riste Skrekovski
Dichotomy for Coloring of Dart Graphs. IWOCA (2010)
Martin Kochol
Smallest counterexample to the 5-flow conjecture has girth at least eleven. J. Comb. Theory, Ser. B 100 (4) (2010)
Martin Kochol
Complexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surface. Discret. Appl. Math. 158 (16) (2010)
Martin Kochol, Nad'a Krivonáková, Silvia Smejová, Katarína Sranková
Reductions of Matrices Associated with Nowhere-Zero Flows. IWOCA (2010)
Martin Kochol
3-Regular Non 3-Edge-Colorable Graphs with Polyhedral Embeddings in Orientable Surfaces. Graph Drawing (2008)
Martin Kochol, Nad'a Krivonáková, Silvia Smejová, Katarína Sranková
Complexity of approximation of 3-edge-coloring of graphs. Inf. Process. Lett. 108 (4) (2008)
Martin Kochol, Nad'a Krivonáková, Silvia Smejová, Katarína Sranková
Counting nowhere-zero flows on wheels. Discret. Math. 308 (10) (2008)
Martin Kochol, Nad'a Krivonáková, Silvia Smejová, Katarína Sranková
-flows on wheels. Electron. Notes Discret. Math. 28 (2007)
Martin Kochol, Nad'a Krivonáková, Silvia Smejová, Katarína Sranková
Approximation of 3-Edge-Coloring of Cubic Graphs. Electron. Notes Discret. Math. 29 (2007)
Martin Kochol, Nad'a Krivonáková, Silvia Smejová, Katarína Sranková
Reductions of matrices associated with nowhere-zero flows. LATA (2007)
Martin Kochol
Restrictions On Smallest Counterexamples To The 5-Flow Conjecture. Comb. 26 (1) (2006)
József Balogh, Martin Kochol, András Pluhár, Xingxing Yu
Covering planar graphs with forests. J. Comb. Theory, Ser. B 94 (1) (2005)
Martin Kochol, Nad'a Krivonáková, Silvia Smejová
Approximation Algorithm for Chromatic Index and Edge-Coloring of Multigraphs. WEA (2005)
Martin Kochol
Decomposition formulas for the flow polynomial. Eur. J. Comb. 26 (7) (2005)
Martin Kochol
3-coloring and 3-clique-ordering of locally connected graphs: . J. Algorithms 54 (1) (2005)
Martin Kochol
About Counterexamples to The 5-Flow Conjecture. Electron. Notes Discret. Math. 22 (2005)
Martin Kochol
Girth restrictions for the 5-flow conjecture. SODA (2005)
Martin Kochol, Nad'a Krivonáková, Silvia Smejová
Edge-coloring of multigraphs. Discret. Math. 300 (1-3) (2005)
Martin Kochol
A note on approximation of a ball by polytopes. Discret. Optim. 1 (2) (2004)
Martin Kochol
Tension-flow polynomials on graphs. Discret. Math. 274 (1-3) (2004)
Martin Kochol
Constructions Of Graphs Without Nowhere-Zero Flows From Boolean Formulas. Ars Comb. 70 (2004)
Mark N. Ellingham, Herbert Fleischner, Martin Kochol, Emanuel Wenger
Colorability of Planar Graphs with Isolated Nontriangular Faces. Graphs Comb. 20 (4) (2004)
Martin Kochol
Snarks and flow-snarks constructed from coloring-snarks. Discret. Math. 278 (1-3) (2004)
Martin Kochol
Reduction of the 5-Flow Conjecture to cyclically 6-edge-connected snarks. J. Comb. Theory, Ser. B 90 (1) (2004)
Martin Kochol, Vadim V. Lozin, Bert Randerath
The 3-Colorability Problem on Graphs with Maximum Degree Four. SIAM J. Comput. 32 (5) (2003)
Martin Kochol
Linear Algorithm for 3-Coloring of Locally Connected Graphs. WEA (2003)
Martin Kochol
On Bases of the Cycle and Cut Spaces in Digraphs. Ars Comb. 68 (2003)
Martin Kochol
A Theorem About Elementary Cuts and Flow Polynomials. Graphs Comb. 19 (3) (2003)
Martin Kochol
Equivalences between hamiltonicity and flow conjectures, and the sublinear defect property. Discret. Math. 254 (1-3) (2002)
Herbert Fleischner, Martin Kochol
A note about the dominating circuit conjecture. Discret. Math. 259 (1-3) (2002)
Martin Kochol
Tension polynomials of graphs. J. Graph Theory 40 (3) (2002)
Martin Kochol
Polynomials Associated with Nowhere-Zero Flows. J. Comb. Theory, Ser. B 84 (2) (2002)
Martin Kochol
Superposition and Constructions of Graphs Without Nowhere-zero k-flows. Eur. J. Comb. 23 (3) (2002)
Martin Kochol
An Equivalent Version of the 3-Flow Conjecture. J. Comb. Theory, Ser. B 83 (2) (2001)
Martin Kochol
Stable dominating circuits in snarks. Discret. Math. 233 (1-3) (2001)
Martin Kochol
Equivalence of Fleischner's and Thomassen's Conjectures. J. Comb. Theory, Ser. B 78 (2) (2000)
Martin Kochol
Hypothetical complexity of the nowhere-zero 5-flow problem. J. Graph Theory 28 (1) (1998)
Martin Kochol
Partial Intersection Theorem and Flows in Abstract Networks. SIAM J. Discret. Math. 11 (3) (1998)
Martin Kochol
Snarks without Small Cycles. J. Comb. Theory, Ser. B 67 (1) (1996)
Martin Kochol
A cyclically 6-edge-connected snark of order 118. Discret. Math. 161 (1-3) (1996)
Andreas Huck, Martin Kochol
Five Cycle Double Covers of Some Cubic Graphs. J. Comb. Theory, Ser. B 64 (1) (1995)
Martin Kochol
Relatively narrow latin parallelpipeds that cannot be extended to a latin cube. Ars Comb. 40 (1995)
Martin Kochol
Compatible systems of representatives. Discret. Math. 132 (1-3) (1994)
Martin Kochol
A note on the arboricity of graphs. Graphs Comb. 8 (4) (1992)
Martin Kochol
The notion and basic properties of M-transversals. Discret. Math. 104 (2) (1992)
Martin Kochol
Efficient monotone circuits for threshold functions. Inf. Process. Lett. 32 (3) (1989)
Martin Kochol
Construction of crossing-critical graphs. Discret. Math. 66 (3) (1987)