The SCEAS System
Navigation Menu

Search the dblp DataBase


Martin Kochol: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  31. 3-Regular Non 3-Edge-Colorable Graphs with Polyhedral Embeddings in Orientable Surfaces. [Citation Graph (, )][DBLP]

  32. Complexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surface. [Citation Graph (, )][DBLP]

  33. Counting nowhere-zero flows on wheels. [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.003secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002