dblp.uni-trier.dewww.uni-trier.de

Martin Kochol

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

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

Coauthor Index

1József Balogh [25]
2Mark N. Ellingham [20]
3Herbert Fleischner [13] [20]
4Andreas Huck [4]
5Nad'a Krivonáková [29] [30] [33] [34] [35] [36]
6Vadim V. Lozin [15]
7András Pluhár [25]
8Bert Randerath [15]
9Silvia Smejová [29] [30] [33] [34] [35] [36]
10Katarína Sranková [33] [34] [35] [36]
11Emanuel Wenger [20]
12Xingxing Yu [25]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)