Martin Kochol - RankMe

65 papers A* 1A 1C 4Journal 56Unranked 2

Year	Rank	Type	Title / Venue / Authors
2023	J	`jnl`	One-to-one correspondence between interpretations of the Tutte polynomials. J. Comb. Theory B Martin Kochol
2022	J	`jnl`	Interpretations for the Tutte polynomials of morphisms of matroids. Discret. Appl. Math. Martin Kochol
2022	J	`jnl`	Polynomials Counting Nowhere-Zero Chains in Graphs. Electron. J. Comb. Martin Kochol
2020	J	`jnl`	Bounds of characteristic polynomials of regular matroids. Contributions Discret. Math. Martin Kochol
2020	J	`jnl`	Modifications of Tutte-Grothendieck invariants and Tutte polynomials. AKCE Int. J. Graphs Comb. Martin Kochol
2019	J	`jnl`	Equivalent versions of group-connectivity theorems and conjectures. Discret. Appl. Math. Martin Kochol
2019	J	`jnl`	Interpretations of the Tutte polynomials of regular matroids. Adv. Appl. Math. Martin Kochol
2018	J	`jnl`	Three colorability characterized by shrinking of locally connected subgraphs into triangles. Inf. Process. Lett. Martin Kochol
2017	J	`jnl`	Edge cut splitting formulas for Tutte-Grothendieck invariants. J. Comb. Theory B Martin Kochol
2016	J	`jnl`	Polynomial algorithms for canonical forms of orientations. J. Comb. Optim. Martin Kochol
2014	J	`jnl`	Linear algebraic approach to an edge-coloring result. J. Comb. Optim. Martin Kochol
2012	J	`jnl`	Brooksʼ Theorem for generalized dart graphs. Inf. Process. Lett. Martin Kochol, Riste Skrekovski
2012	J	`jnl`	Non-extendible latin parallelepipeds. Inf. Process. Lett. Martin Kochol
2011	J	`jnl`	Coefficients of chromatic polynomials and tension polynomials. Contributions Discret. Math. Martin Kochol, Nad'a Krivonáková
2011	C	`conf`	Decomposition of Tutte Polynomial. CTW Martin Kochol
2011	J	`jnl`	Matrix reduction in a combinatorial computation. Inf. Process. Lett. Martin Kochol, Nad'a Krivonáková, Silvia Smejová, Katarína Sranková
2011	J	`jnl`	Three measures of edge-uncolorability. Discret. Math. Martin Kochol
2010	J	`jnl`	Complexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surface. Discret. Appl. Math. Martin Kochol
2010	C	`conf`	Dichotomy for Coloring of Dart Graphs. IWOCA Martin Kochol, Riste Skrekovski
2010	—	`book`	Flows in Graphs and Related Problems - Nowhere-Zero Flows, Cycle Covers, and Combinatorial Optimization. Martin Kochol
2010	C	`conf`	Reductions of Matrices Associated with Nowhere-Zero Flows. IWOCA Martin Kochol, Nad'a Krivonáková, Silvia Smejová, Katarína Sranková
2010	J	`jnl`	Smallest counterexample to the 5-flow conjecture has girth at least eleven. J. Comb. Theory B Martin Kochol
2008	A	`conf`	3-Regular Non 3-Edge-Colorable Graphs with Polyhedral Embeddings in Orientable Surfaces. GD Martin Kochol
2008	J	`jnl`	Complexity of approximation of 3-edge-coloring of graphs. Inf. Process. Lett. Martin Kochol, Nad'a Krivonáková, Silvia Smejová, Katarína Sranková
2008	J	`jnl`	Counting nowhere-zero flows on wheels. Discret. Math. Martin Kochol, Nad'a Krivonáková, Silvia Smejová, Katarína Sranková
2007	J	`jnl`	Approximation of 3-Edge-Coloring of Cubic Graphs. Electron. Notes Discret. Math. Martin Kochol, Nad'a Krivonáková, Silvia Smejová, Katarína Sranková
2007	J	`jnl`	Nowhere-zero Electron. Notes Discret. Math. Martin Kochol, Nad'a Krivonáková, Silvia Smejová, Katarína Sranková
2007	C	`conf`	Reductions of matrices associated with nowhere-zero flows. LATA Martin Kochol, Nad'a Krivonáková, Silvia Smejová, Katarína Sranková
2006	J	`jnl`	Restrictions On Smallest Counterexamples To The 5-Flow Conjecture. Comb. Martin Kochol
2005	J	`jnl`	3-coloring and 3-clique-ordering of locally connected graphs: . J. Algorithms Martin Kochol
2005	J	`jnl`	About Counterexamples to The 5-Flow Conjecture. Electron. Notes Discret. Math. Martin Kochol
2005	—	`conf`	Approximation Algorithm for Chromatic Index and Edge-Coloring of Multigraphs. WEA Martin Kochol, Nad'a Krivonáková, Silvia Smejová
2005	J	`jnl`	Covering planar graphs with forests. J. Comb. Theory B József Balogh, Martin Kochol, András Pluhár, Xingxing Yu
2005	J	`jnl`	Decomposition formulas for the flow polynomial. Eur. J. Comb. Martin Kochol
2005	J	`jnl`	Edge-coloring of multigraphs. Discret. Math. Martin Kochol, Nad'a Krivonáková, Silvia Smejová
2005	A*	`conf`	Girth restrictions for the 5-flow conjecture. SODA Martin Kochol
2004	J	`jnl`	A note on approximation of a ball by polytopes. Discret. Optim. Martin Kochol
2004	J	`jnl`	Colorability of Planar Graphs with Isolated Nontriangular Faces. Graphs Comb. Mark N. Ellingham, Herbert Fleischner, Martin Kochol, Emanuel Wenger
2004	J	`jnl`	Constructions Of Graphs Without Nowhere-Zero Flows From Boolean Formulas. Ars Comb. Martin Kochol
2004	J	`jnl`	Reduction of the 5-Flow Conjecture to cyclically 6-edge-connected snarks. J. Comb. Theory B Martin Kochol
2004	J	`jnl`	Snarks and flow-snarks constructed from coloring-snarks. Discret. Math. Martin Kochol
2004	J	`jnl`	Tension-flow polynomials on graphs. Discret. Math. Martin Kochol
2003	J	`jnl`	A Theorem About Elementary Cuts and Flow Polynomials. Graphs Comb. Martin Kochol
2003	—	`conf`	Linear Algorithm for 3-Coloring of Locally Connected Graphs. WEA Martin Kochol
2003	J	`jnl`	On Bases of the Cycle and Cut Spaces in Digraphs. Ars Comb. Martin Kochol
2003	J	`jnl`	The 3-Colorability Problem on Graphs with Maximum Degree Four. SIAM J. Comput. Martin Kochol, Vadim V. Lozin, Bert Randerath
2002	J	`jnl`	A note about the dominating circuit conjecture. Discret. Math. Herbert Fleischner, Martin Kochol
2002	J	`jnl`	Equivalences between hamiltonicity and flow conjectures, and the sublinear defect property. Discret. Math. Martin Kochol
2002	J	`jnl`	Polynomials Associated with Nowhere-Zero Flows. J. Comb. Theory B Martin Kochol
2002	J	`jnl`	Superposition and Constructions of Graphs Without Nowhere-zero k-flows. Eur. J. Comb. Martin Kochol
2002	J	`jnl`	Tension polynomials of graphs. J. Graph Theory Martin Kochol
2001	J	`jnl`	An Equivalent Version of the 3-Flow Conjecture. J. Comb. Theory B Martin Kochol
2001	J	`jnl`	Stable dominating circuits in snarks. Discret. Math. Martin Kochol
2000	J	`jnl`	Equivalence of Fleischner's and Thomassen's Conjectures. J. Comb. Theory B Martin Kochol
1998	J	`jnl`	Hypothetical complexity of the nowhere-zero 5-flow problem. J. Graph Theory Martin Kochol
1998	J	`jnl`	Partial Intersection Theorem and Flows in Abstract Networks. SIAM J. Discret. Math. Martin Kochol
1996	J	`jnl`	A cyclically 6-edge-connected snark of order 118. Discret. Math. Martin Kochol
1996	J	`jnl`	Snarks without Small Cycles. J. Comb. Theory B Martin Kochol
1995	J	`jnl`	Five Cycle Double Covers of Some Cubic Graphs. J. Comb. Theory B Andreas Huck, Martin Kochol
1995	J	`jnl`	Relatively narrow latin parallelpipeds that cannot be extended to a latin cube. Ars Comb. Martin Kochol
1994	J	`jnl`	Compatible systems of representatives. Discret. Math. Martin Kochol
1992	J	`jnl`	A note on the arboricity of graphs. Graphs Comb. Martin Kochol
1992	J	`jnl`	The notion and basic properties of M-transversals. Discret. Math. Martin Kochol
1989	J	`jnl`	Efficient monotone circuits for threshold functions. Inf. Process. Lett. Martin Kochol
1987	J	`jnl`	Construction of crossing-critical graphs. Discret. Math. Martin Kochol