| 2008 |
|---|
| 37 | EE | Martin Kochol:
3-Regular Non 3-Edge-Colorable Graphs with Polyhedral Embeddings in Orientable Surfaces.
Graph Drawing 2008: 319-323 |
| 36 | EE | Martin Kochol,
Nad'a Krivonáková,
Silvia Smejová,
Katarína Sranková:
Counting nowhere-zero flows on wheels.
Discrete Mathematics 308(10): 2050-2053 (2008) |
| 35 | EE | 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): 238-241 (2008) |
| 2007 |
|---|
| 34 | EE | Martin Kochol,
Nad'a Krivonáková,
Silvia Smejová,
Katarína Sranková:
Nowhere-zero I-flows on wheels.
Electronic Notes in Discrete Mathematics 28: 103-107 (2007) |
| 33 | EE | Martin Kochol,
Nad'a Krivonáková,
Silvia Smejová,
Katarína Sranková:
Approximation of 3-Edge-Coloring of Cubic Graphs.
Electronic Notes in Discrete Mathematics 29: 91-95 (2007) |
| 2006 |
|---|
| 32 | EE | Martin Kochol:
Restrictions On Smallest Counterexamples To The 5-Flow Conjecture.
Combinatorica 26(1): 83-89 (2006) |
| 2005 |
|---|
| 31 | EE | Martin Kochol:
Girth restrictions for the 5-flow conjecture.
SODA 2005: 705-707 |
| 30 | EE | Martin Kochol,
Nad'a Krivonáková,
Silvia Smejová:
Approximation Algorithm for Chromatic Index and Edge-Coloring of Multigraphs.
WEA 2005: 602-605 |
| 29 | EE | Martin Kochol,
Nad'a Krivonáková,
Silvia Smejová:
Edge-coloring of multigraphs.
Discrete Mathematics 300(1-3): 229-234 (2005) |
| 28 | EE | Martin Kochol:
About Counterexamples to The 5-Flow Conjecture.
Electronic Notes in Discrete Mathematics 22: 21-24 (2005) |
| 27 | EE | Martin Kochol:
Decomposition formulas for the flow polynomial.
Eur. J. Comb. 26(7): 1086-1093 (2005) |
| 26 | EE | Martin Kochol:
3-coloring and 3-clique-ordering of locally connected graphs: .
J. Algorithms 54(1): 122-125 (2005) |
| 25 | EE | József Balogh,
Martin Kochol,
András Pluhár,
Xingxing Yu:
Covering planar graphs with forests.
J. Comb. Theory, Ser. B 94(1): 147-158 (2005) |
| 2004 |
|---|
| 24 | | Martin Kochol:
Constructions Of Graphs Without Nowhere-Zero Flows From Boolean Formulas.
Ars Comb. 70: (2004) |
| 23 | EE | Martin Kochol:
Tension-flow polynomials on graphs.
Discrete Mathematics 274(1-3): 173-185 (2004) |
| 22 | EE | Martin Kochol:
Snarks and flow-snarks constructed from coloring-snarks.
Discrete Mathematics 278(1-3): 165-174 (2004) |
| 21 | EE | Martin Kochol:
A note on approximation of a ball by polytopes.
Discrete Optimization 1(2): 229-231 (2004) |
| 20 | EE | Mark N. Ellingham,
Herbert Fleischner,
Martin Kochol,
Emanuel Wenger:
Colorability of Planar Graphs with Isolated Nontriangular Faces.
Graphs and Combinatorics 20(4): 443-446 (2004) |
| 19 | EE | Martin Kochol:
Reduction of the 5-Flow Conjecture to cyclically 6-edge-connected snarks.
J. Comb. Theory, Ser. B 90(1): 139-145 (2004) |
| 2003 |
|---|
| 18 | EE | Martin Kochol:
Linear Algorithm for 3-Coloring of Locally Connected Graphs.
WEA 2003: 191-194 |
| 17 | | Martin Kochol:
On Bases of the Cycle and Cut Spaces in Digraphs.
Ars Comb. 68: (2003) |
| 16 | EE | Martin Kochol:
A Theorem About Elementary Cuts and Flow Polynomials.
Graphs and Combinatorics 19(3): 389-392 (2003) |
| 15 | EE | Martin Kochol,
Vadim V. Lozin,
Bert Randerath:
The 3-Colorability Problem on Graphs with Maximum Degree Four.
SIAM J. Comput. 32(5): 1128-1139 (2003) |
| 2002 |
|---|
| 14 | EE | Martin Kochol:
Equivalences between hamiltonicity and flow conjectures, and the sublinear defect property.
Discrete Mathematics 254(1-3): 221-230 (2002) |
| 13 | EE | Herbert Fleischner,
Martin Kochol:
A note about the dominating circuit conjecture.
Discrete Mathematics 259(1-3): 307-309 (2002) |
| 12 | EE | Martin Kochol:
Superposition and Constructions of Graphs Without Nowhere-zero k-flows.
Eur. J. Comb. 23(3): 281-306 (2002) |
| 11 | EE | Martin Kochol:
Polynomials Associated with Nowhere-Zero Flows.
J. Comb. Theory, Ser. B 84(2): 260-269 (2002) |
| 2001 |
|---|
| 10 | EE | Martin Kochol:
Stable dominating circuits in snarks.
Discrete Mathematics 233(1-3): 247-256 (2001) |
| 9 | EE | Martin Kochol:
An Equivalent Version of the 3-Flow Conjecture.
J. Comb. Theory, Ser. B 83(2): 258-261 (2001) |
| 2000 |
|---|
| 8 | EE | Martin Kochol:
Equivalence of Fleischner's and Thomassen's Conjectures.
J. Comb. Theory, Ser. B 78(2): 277-279 (2000) |
| 1998 |
|---|
| 7 | EE | Martin Kochol:
Partial Intersection Theorem and Flows in Abstract Networks.
SIAM J. Discrete Math. 11(3): 468-486 (1998) |
| 1996 |
|---|
| 6 | EE | Martin Kochol:
A cyclically 6-edge-connected snark of order 118.
Discrete Mathematics 161(1-3): 297-300 (1996) |
| 5 | EE | Martin Kochol:
Snarks without Small Cycles.
J. Comb. Theory, Ser. B 67(1): 34-47 (1996) |
| 1995 |
|---|
| 4 | EE | Andreas Huck,
Martin Kochol:
Five Cycle Double Covers of Some Cubic Graphs.
J. Comb. Theory, Ser. B 64(1): 119-125 (1995) |
| 1994 |
|---|
| 3 | EE | Martin Kochol:
Compatible systems of representatives.
Discrete Mathematics 132(1-3): 115-126 (1994) |
| 1992 |
|---|
| 2 | EE | Martin Kochol:
The notion and basic properties of M-transversals.
Discrete Mathematics 104(2): 191-196 (1992) |
| 1987 |
|---|
| 1 | EE | Martin Kochol:
Construction of crossing-critical graphs.
Discrete Mathematics 66(3): 311-313 (1987) |
