M. Kochol

发表

Constructive approximation of a ball by polytopes

M. Kochol, 1994 .

Akademie Vědčeské Republiky

M. Kochol, 2004 .

Brooks Theorem for Dart Graphs

M. Kochol, R. Škrekovski, 2011 .

Modifications of Tutte-Grothendieck invariants and Tutte polynomials

M. Kochol, 2014, AKCE Int. J. Graphs Comb..

Interpretations of the Tutte and characteristic polynomials of matroids

M. Kochol, 2019, Journal of Algebraic Combinatorics.

Tension polynomials of graphs

Martin Kochol, M. Kochol, 2002 .

Quantitative Methods for Nowhere-Zero Flows and Edge Colorings

M. Kochol, 2014 .

Edge cut splitting formulas for Tutte-Grothendieck invariants

Martin Kochol, M. Kochol, 2017, J. Comb. Theory, Ser. B.

Compatible systems of representatives

Martin Kochol, M. Kochol, 1994, Discret. Math..

Decomposition formulas for the flow polynomial

Martin Kochol, M. Kochol, 2005, Eur. J. Comb..

Tension-flow polynomials on graphs

Martin Kochol, M. Kochol, 2004, Discret. Math..

Polynomials Associated with Nowhere-Zero Flows

Martin Kochol, M. Kochol, 2002, J. Comb. Theory, Ser. B.

Tension polynomials of graphs

Martin Kochol, M. Kochol, 2002, J. Graph Theory.

3-coloring and 3-clique-ordering of Locally Connected Graphs:

Martin Kochol, M. Kochol, 2005, J. Algorithms.

Bounds of characteristic polynomials of regular matroids

M. Kochol, 2020, Contributions Discret. Math..

Interpretations of the Tutte polynomials of regular matroids

Martin Kochol, M. Kochol, 2019, Adv. Appl. Math..

A note on approximation of a ball by polytopes

Martin Kochol, M. Kochol, 2004, Discret. Optim..

The notion and basic properties of M-transversals

Martin Kochol, M. Kochol, 1992, Discret. Math..

Construction of crossing-critical graphs

Martin Kochol, M. Kochol, 1987, Discret. Math..

Varieties of modularp-algebras not containingM3,3

M. Kochol, 1991 .

Non-extendible latin parallelepipeds

Martin Kochol, M. Kochol, 2012, Inf. Process. Lett..

Relatively narrow latin parallelpipeds that cannot be extended to a latin cube

Martin Kochol, M. Kochol, 1995, Ars Comb..

Partial Intersection Theorem and Flows in Abstract Networks

Martin Kochol, M. Kochol, 1998, SIAM J. Discret. Math..

Covering planar graphs with forests

Xingxing Yu, József Balogh, Martin Kochol, 2005, J. Comb. Theory, Ser. B.

QUASI POLYMATROIDAL FLOW NETWORKS

M. Kochol, M. Kochol, 1995 .

Polynomial algorithms for canonical forms of orientations

M. Kochol, 2014, Journal of Combinatorial Optimization.

Polynomial algorithms for canonical forms of orientations

Martin Kochol, M. Kochol, 2016, J. Comb. Optim..

Snarks without Small Cycles

Martin Kochol, M. Kochol, 1996, J. Comb. Theory, Ser. B.

Linear Algebraic Relations among Cardinalities of Sets of Matroid Functions

M. Kochol, 2023, Mathematics.

Smallest counterexample to the 5-flow conjecture has girth at least eleven

Martin Kochol, M. Kochol, 2010, J. Comb. Theory, Ser. B.

Restrictions On Smallest Counterexamples To The 5-Flow Conjecture

Martin Kochol, M. Kochol, 2006, Comb..

Reduction of the 5-Flow Conjecture to cyclically 6-edge-connected snarks

Martin Kochol, M. Kochol, 2004, J. Comb. Theory, Ser. B.

Linear algebraic approach to an edge-coloring result

Martin Kochol, M. Kochol, 2014, J. Comb. Optim..

Linear algebraic approach to an edge-coloring result

M. Kochol, 2012, Journal of Combinatorial Optimization.

Nowhere-zero I-flows on wheels

Martin Kochol, Nad'a Krivonáková, Silvia Smejová, 2007, Electron. Notes Discret. Math..

Superposition and Constructions of Graphs Without Nowhere-zero k-flows

Martin Kochol, M. Kochol, 2002, Eur. J. Comb..

CUBIC GRAPHS WITHOUT A PETERSEN MINOR HAVE NOWHERE – ZERO 5 – FLOWS

M. Kochol, M. KOCHOL, 1999 .

A Theorem About Elementary Cuts and Flow Polynomials

Martin Kochol, M. Kochol, 2003, Graphs Comb..