| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Martin Kochol, Riste Skrekovski |
Brooksʼ Theorem for generalized dart graphs.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kochol, Nad'a Krivonáková, Silvia Smejová, Katarína Sranková |
Matrix reduction in a combinatorial computation. |
Inf. Process. Lett. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kochol |
Three measures of edge-uncolorability. |
Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kochol |
Decomposition of Tutte Polynomial. |
CTW |
2011 |
DBLP BibTeX RDF |
|
| 1 | Martin Kochol |
Smallest counterexample to the 5-flow conjecture has girth at least eleven. |
J. Comb. Theory, Ser. B |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kochol |
Complexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surface. |
Discrete Applied Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kochol, Riste Skrekovski |
Dichotomy for Coloring of Dart Graphs. |
IWOCA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kochol, Nad'a Krivonáková, Silvia Smejová, Katarína Sranková |
Reductions of Matrices Associated with Nowhere-Zero Flows. |
IWOCA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kochol, Nad'a Krivonáková, Silvia Smejová, Katarína Sranková |
Complexity of approximation of 3-edge-coloring of graphs. |
Inf. Process. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kochol, Nad'a Krivonáková, Silvia Smejová, Katarína Sranková |
Counting nowhere-zero flows on wheels. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kochol |
3-Regular Non 3-Edge-Colorable Graphs with Polyhedral Embeddings in Orientable Surfaces. |
Graph Drawing |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kochol, Nad'a Krivonáková, Silvia Smejová, Katarína Sranková |
Approximation of 3-Edge-Coloring of Cubic Graphs. |
Electronic Notes in Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kochol, Nad'a Krivonáková, Silvia Smejová, Katarína Sranková |
Nowhere-zero I-flows on wheels. |
Electronic Notes in Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kochol, Nad'a Krivonáková, Silvia Smejová, Katarína Sranková |
Reductions of matrices associated with nowhere-zero flows. |
LATA |
2007 |
DBLP BibTeX RDF |
|
| 1 | Martin Kochol |
Restrictions On Smallest Counterexamples To The 5-Flow Conjecture. |
Combinatorica |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C15 |
| 1 | József Balogh, Martin Kochol, András Pluhár, Xingxing Yu |
Covering planar graphs with forests. |
J. Comb. Theory, Ser. B |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kochol |
About Counterexamples to The 5-Flow Conjecture. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kochol, Nad'a Krivonáková, Silvia Smejová |
Edge-coloring of multigraphs. |
Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kochol |
Decomposition formulas for the flow polynomial. |
Eur. J. Comb. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kochol |
3-coloring and 3-clique-ordering of locally connected graphs: . |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kochol |
Girth restrictions for the 5-flow conjecture. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kochol, Nad'a Krivonáková, Silvia Smejová |
Approximation Algorithm for Chromatic Index and Edge-Coloring of Multigraphs. |
WEA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kochol |
Reduction of the 5-Flow Conjecture to cyclically 6-edge-connected snarks. |
J. Comb. Theory, Ser. B |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kochol |
A note on approximation of a ball by polytopes. |
Discrete Optimization |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kochol |
Tension-flow polynomials on graphs. |
Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kochol |
Snarks and flow-snarks constructed from coloring-snarks. |
Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark N. Ellingham, Herbert Fleischner, Martin Kochol, Emanuel Wenger |
Colorability of Planar Graphs with Isolated Nontriangular Faces. |
Graphs and Combinatorics |
2004 |
DBLP DOI BibTeX RDF |
Eulerian triangulation, Hole graph, 3-Coloring |
| 1 | Martin Kochol |
Constructions Of Graphs Without Nowhere-Zero Flows From Boolean Formulas. |
Ars Comb. |
2004 |
DBLP BibTeX RDF |
|
| 1 | Martin Kochol |
A Theorem About Elementary Cuts and Flow Polynomials. |
Graphs and Combinatorics |
2003 |
DBLP DOI BibTeX RDF |
Nowhere-zero flow, (Integral) Flow polynomial, Equivalence classes of flows, Positive orientation of a nowhere-zero integral flow |
| 1 | Martin Kochol, Vadim V. Lozin, Bert Randerath |
The 3-Colorability Problem on Graphs with Maximum Degree Four. |
SIAM J. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kochol |
On Bases of the Cycle and Cut Spaces in Digraphs. |
Ars Comb. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Martin Kochol |
Linear Algorithm for 3-Coloring of Locally Connected Graphs. |
WEA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kochol |
Polynomials Associated with Nowhere-Zero Flows. |
J. Comb. Theory, Ser. B |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Herbert Fleischner, Martin Kochol |
A note about the dominating circuit conjecture. |
Discrete Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kochol |
Equivalences between hamiltonicity and flow conjectures, and the sublinear defect property. |
Discrete Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kochol |
Superposition and Constructions of Graphs Without Nowhere-zero k-flows. |
Eur. J. Comb. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kochol |
An Equivalent Version of the 3-Flow Conjecture. |
J. Comb. Theory, Ser. B |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kochol |
Stable dominating circuits in snarks. |
Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kochol |
Equivalence of Fleischner's and Thomassen's Conjectures. |
J. Comb. Theory, Ser. B |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kochol |
Partial Intersection Theorem and Flows in Abstract Networks. |
SIAM J. Discrete Math. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kochol |
Snarks without Small Cycles. |
J. Comb. Theory, Ser. B |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kochol |
A cyclically 6-edge-connected snark of order 118. |
Discrete Mathematics |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Huck, Martin Kochol |
Five Cycle Double Covers of Some Cubic Graphs. |
J. Comb. Theory, Ser. B |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kochol |
Compatible systems of representatives. |
Discrete Mathematics |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kochol |
The notion and basic properties of M-transversals. |
Discrete Mathematics |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kochol |
A note on the arboricity of graphs. |
Graphs and Combinatorics |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kochol |
Efficient monotone circuits for threshold functions. |
Inf. Process. Lett. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kochol |
Construction of crossing-critical graphs. |
Discrete Mathematics |
1987 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")