![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Martin Kochol
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j56]Martin Kochol:
One-to-one correspondence between interpretations of the Tutte polynomials. J. Comb. Theory B 162: 134-143 (2023) - 2022
- [j55]Martin Kochol:
Polynomials Counting Nowhere-Zero Chains in Graphs. Electron. J. Comb. 29(1) (2022) - [j54]Martin Kochol:
Interpretations for the Tutte polynomials of morphisms of matroids. Discret. Appl. Math. 322: 210-216 (2022) - 2020
- [j53]Martin Kochol:
Modifications of Tutte-Grothendieck invariants and Tutte polynomials. AKCE Int. J. Graphs Comb. 17(1): 70-73 (2020) - [j52]Martin Kochol:
Bounds of characteristic polynomials of regular matroids. Contributions Discret. Math. 15(3): 98-107 (2020)
2010 – 2019
- 2019
- [j51]Martin Kochol:
Interpretations of the Tutte polynomials of regular matroids. Adv. Appl. Math. 111 (2019) - [j50]Martin Kochol:
Equivalent versions of group-connectivity theorems and conjectures. Discret. Appl. Math. 257: 350-352 (2019) - 2018
- [j49]Martin Kochol:
Three colorability characterized by shrinking of locally connected subgraphs into triangles. Inf. Process. Lett. 135: 33-35 (2018) - 2017
- [j48]Martin Kochol:
Edge cut splitting formulas for Tutte-Grothendieck invariants. J. Comb. Theory B 125: 114-131 (2017) - 2016
- [j47]Martin Kochol:
Polynomial algorithms for canonical forms of orientations. J. Comb. Optim. 31(1): 218-222 (2016) - 2014
- [j46]Martin Kochol:
Linear algebraic approach to an edge-coloring result. J. Comb. Optim. 28(2): 341-347 (2014) - 2012
- [j45]Martin Kochol, Riste Skrekovski
:
Brooksʼ Theorem for generalized dart graphs. Inf. Process. Lett. 112(5): 200-204 (2012) - [j44]Martin Kochol:
Non-extendible latin parallelepipeds. Inf. Process. Lett. 112(24): 942-943 (2012) - 2011
- [j43]Martin Kochol, Nad'a Krivonáková:
Coefficients of chromatic polynomials and tension polynomials. Contributions Discret. Math. 6(1) (2011) - [j42]Martin Kochol:
Three measures of edge-uncolorability. Discret. Math. 311(1): 106-108 (2011) - [j41]Martin Kochol, Nad'a Krivonáková, Silvia Smejová, Katarína Sranková:
Matrix reduction in a combinatorial computation. Inf. Process. Lett. 111(4): 164-168 (2011) - [c8]Martin Kochol:
Decomposition of Tutte Polynomial. CTW 2011: 177-179 - 2010
- [b1]Martin Kochol:
Flows in Graphs and Related Problems - Nowhere-Zero Flows, Cycle Covers, and Combinatorial Optimization. LAP Lambert Academic Publishing 2010, ISBN 978-3-8433-7654-9, pp. 1-125 - [j40]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): 1856-1860 (2010) - [j39]Martin Kochol:
Smallest counterexample to the 5-flow conjecture has girth at least eleven. J. Comb. Theory B 100(4): 381-389 (2010) - [c7]Martin Kochol, Riste Skrekovski
:
Dichotomy for Coloring of Dart Graphs. IWOCA 2010: 82-89 - [c6]Martin Kochol, Nad'a Krivonáková, Silvia Smejová, Katarína Sranková:
Reductions of Matrices Associated with Nowhere-Zero Flows. IWOCA 2010: 192-200
2000 – 2009
- 2008
- [j38]Martin Kochol, Nad'a Krivonáková, Silvia Smejová, Katarína Sranková:
Counting nowhere-zero flows on wheels. Discret. Math. 308(10): 2050-2053 (2008) - [j37]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) - [c5]Martin Kochol:
3-Regular Non 3-Edge-Colorable Graphs with Polyhedral Embeddings in Orientable Surfaces. GD 2008: 319-323 - 2007
- [j36]Martin Kochol, Nad'a Krivonáková, Silvia Smejová, Katarína Sranková:
Nowhere-zero I-flows on wheels. Electron. Notes Discret. Math. 28: 103-107 (2007) - [j35]Martin Kochol, Nad'a Krivonáková, Silvia Smejová, Katarína Sranková:
Approximation of 3-Edge-Coloring of Cubic Graphs. Electron. Notes Discret. Math. 29: 91-95 (2007) - [c4]Martin Kochol, Nad'a Krivonáková, Silvia Smejová, Katarína Sranková:
Reductions of matrices associated with nowhere-zero flows. LATA 2007: 297-306 - 2006
- [j34]Martin Kochol:
Restrictions On Smallest Counterexamples To The 5-Flow Conjecture. Comb. 26(1): 83-89 (2006) - 2005
- [j33]Martin Kochol, Nad'a Krivonáková, Silvia Smejová:
Edge-coloring of multigraphs. Discret. Math. 300(1-3): 229-234 (2005) - [j32]Martin Kochol:
Decomposition formulas for the flow polynomial. Eur. J. Comb. 26(7): 1086-1093 (2005) - [j31]Martin Kochol:
About Counterexamples to The 5-Flow Conjecture. Electron. Notes Discret. Math. 22: 21-24 (2005) - [j30]Martin Kochol:
3-coloring and 3-clique-ordering of locally connected graphs: . J. Algorithms 54(1): 122-125 (2005) - [j29]József Balogh, Martin Kochol, András Pluhár, Xingxing Yu:
Covering planar graphs with forests. J. Comb. Theory B 94(1): 147-158 (2005) - [c3]Martin Kochol:
Girth restrictions for the 5-flow conjecture. SODA 2005: 705-707 - [c2]Martin Kochol, Nad'a Krivonáková, Silvia Smejová:
Approximation Algorithm for Chromatic Index and Edge-Coloring of Multigraphs. WEA 2005: 602-605 - 2004
- [j28]Martin Kochol:
Constructions Of Graphs Without Nowhere-Zero Flows From Boolean Formulas. Ars Comb. 70 (2004) - [j27]Martin Kochol:
A note on approximation of a ball by polytopes. Discret. Optim. 1(2): 229-231 (2004) - [j26]Martin Kochol:
Tension-flow polynomials on graphs. Discret. Math. 274(1-3): 173-185 (2004) - [j25]Martin Kochol:
Snarks and flow-snarks constructed from coloring-snarks. Discret. Math. 278(1-3): 165-174 (2004) - [j24]Mark N. Ellingham, Herbert Fleischner, Martin Kochol, Emanuel Wenger:
Colorability of Planar Graphs with Isolated Nontriangular Faces. Graphs Comb. 20(4): 443-446 (2004) - [j23]Martin Kochol:
Reduction of the 5-Flow Conjecture to cyclically 6-edge-connected snarks. J. Comb. Theory B 90(1): 139-145 (2004) - 2003
- [j22]Martin Kochol:
On Bases of the Cycle and Cut Spaces in Digraphs. Ars Comb. 68 (2003) - [j21]Martin Kochol:
A Theorem About Elementary Cuts and Flow Polynomials. Graphs Comb. 19(3): 389-392 (2003) - [j20]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) - [c1]Martin Kochol:
Linear Algorithm for 3-Coloring of Locally Connected Graphs. WEA 2003: 191-194 - 2002
- [j19]Martin Kochol:
Equivalences between hamiltonicity and flow conjectures, and the sublinear defect property. Discret. Math. 254(1-3): 221-230 (2002) - [j18]Herbert Fleischner, Martin Kochol:
A note about the dominating circuit conjecture. Discret. Math. 259(1-3): 307-309 (2002) - [j17]Martin Kochol:
Superposition and Constructions of Graphs Without Nowhere-zero k-flows. Eur. J. Comb. 23(3): 281-306 (2002) - [j16]Martin Kochol:
Polynomials Associated with Nowhere-Zero Flows. J. Comb. Theory B 84(2): 260-269 (2002) - [j15]Martin Kochol:
Tension polynomials of graphs. J. Graph Theory 40(3): 137-146 (2002) - 2001
- [j14]Martin Kochol:
Stable dominating circuits in snarks. Discret. Math. 233(1-3): 247-256 (2001) - [j13]Martin Kochol:
An Equivalent Version of the 3-Flow Conjecture. J. Comb. Theory B 83(2): 258-261 (2001) - 2000
- [j12]Martin Kochol:
Equivalence of Fleischner's and Thomassen's Conjectures. J. Comb. Theory B 78(2): 277-279 (2000)
1990 – 1999
- 1998
- [j11]Martin Kochol:
Hypothetical complexity of the nowhere-zero 5-flow problem. J. Graph Theory 28(1): 1-11 (1998) - [j10]Martin Kochol:
Partial Intersection Theorem and Flows in Abstract Networks. SIAM J. Discret. Math. 11(3): 468-486 (1998) - 1996
- [j9]Martin Kochol:
A cyclically 6-edge-connected snark of order 118. Discret. Math. 161(1-3): 297-300 (1996) - [j8]Martin Kochol:
Snarks without Small Cycles. J. Comb. Theory B 67(1): 34-47 (1996) - 1995
- [j7]Martin Kochol:
Relatively narrow latin parallelpipeds that cannot be extended to a latin cube. Ars Comb. 40 (1995) - [j6]Andreas Huck, Martin Kochol:
Five Cycle Double Covers of Some Cubic Graphs. J. Comb. Theory B 64(1): 119-125 (1995) - 1994
- [j5]Martin Kochol:
Compatible systems of representatives. Discret. Math. 132(1-3): 115-126 (1994) - 1992
- [j4]Martin Kochol:
The notion and basic properties of M-transversals. Discret. Math. 104(2): 191-196 (1992) - [j3]Martin Kochol:
A note on the arboricity of graphs. Graphs Comb. 8(4): 313-315 (1992)
1980 – 1989
- 1989
- [j2]Martin Kochol:
Efficient monotone circuits for threshold functions. Inf. Process. Lett. 32(3): 121-122 (1989) - 1987
- [j1]Martin Kochol:
Construction of crossing-critical graphs. Discret. Math. 66(3): 311-313 (1987)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint