The following pages link to Martin Kochol (Q186141):
Displaying 50 items.
- Brooks' theorem for generalized dart graphs (Q413285) (← links)
- Complexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surface (Q602768) (← links)
- Three measures of edge-uncolorability (Q616368) (← links)
- Colorability of planar graphs with isolated nontriangular faces (Q704852) (← links)
- Counting nowhere-zero flows on wheels (Q952677) (← links)
- Smallest counterexample to the 5-flow conjecture has girth at least eleven (Q974466) (← links)
- Complexity of approximation of 3-edge-coloring of graphs (Q975462) (← links)
- Construction of crossing-critical graphs (Q1088998) (← links)
- Efficient monotone circuits for threshold functions (Q1122560) (← links)
- Varieties of modular \(p\)-algebras not containing \(M_{3,3}\) (Q1180704) (← links)
- The notion and basic properties of \(M\)-transversals (Q1196992) (← links)
- A note on the arboricity of graphs (Q1205341) (← links)
- Compatible systems of representatives (Q1336656) (← links)
- A cyclically 6-edge-connected snark of order 118 (Q1356433) (← links)
- A theorem about elementary cuts and flow polynomials (Q1411114) (← links)
- Tension-flow polynomials on graphs (Q1421520) (← links)
- Reduction of the 5-flow conjecture to cyclically 6-edge-connected snarks. (Q1425113) (← links)
- Snarks and flow-snarks constructed from coloring-snarks. (Q1427477) (← links)
- Equivalence of Fleischner's and Thomassen's conjectures (Q1569072) (← links)
- Superposition and constructions of graphs without nowhere-zero \(k\)-flows (Q1612758) (← links)
- Equivalences between Hamiltonicity and flow conjectures, and the sublinear defect property (Q1613542) (← links)
- Three colorability characterized by shrinking of locally connected subgraphs into triangles (Q1708265) (← links)
- Equivalent versions of group-connectivity theorems and conjectures (Q1730259) (← links)
- Covering planar graphs with forests (Q1775897) (← links)
- An equivalent version of the 3-flow conjecture (Q1850566) (← links)
- Polynomials associated with nowhere-zero flows (Q1850590) (← links)
- A note about the dominating circuit conjecture (Q1861225) (← links)
- Five cycle double covers of some cubic graphs (Q1892855) (← links)
- Snarks without small cycles (Q1924136) (← links)
- Non-extendible Latin parallelepipeds (Q1941697) (← links)
- Matrix reduction in a combinatorial computation (Q1944064) (← links)
- Interpretations of the Tutte and characteristic polynomials of matroids (Q2025137) (← links)
- Polynomials counting nowhere-zero chains in graphs (Q2073314) (← links)
- Interpretations for the Tutte polynomials of morphisms of matroids (Q2081485) (← links)
- Linear algebraic approach to an edge-coloring result (Q2251134) (← links)
- Interpretations of the Tutte polynomials of regular matroids (Q2334522) (← links)
- A note on approximation of a ball by polytopes (Q2386205) (← links)
- Edge cut splitting formulas for Tutte-Grothendieck invariants (Q2396895) (← links)
- Restrictions on smallest counterexamples to the 5-flow conjecture (Q2495696) (← links)
- Decomposition formulas for the flow polynomial (Q2567283) (← links)
- Edge-coloring of multigraphs (Q2570119) (← links)
- (Q2921731) (← links)
- Dichotomy for Coloring of Dart Graphs (Q3000496) (← links)
- Reductions of Matrices Associated with Nowhere-Zero Flows (Q3000507) (← links)
- Symmetrized and continuous generalization of transversals (Q3128565) (← links)
- Tension polynomials of graphs (Q3150191) (← links)
- (Q3150349) (← links)
- About Counterexamples to The 5-Flow Conjecture (Q3439303) (← links)
- Nowhere-zero -flows on wheels (Q3439571) (← links)
- Approximation of 3-Edge-Coloring of Cubic Graphs (Q3503456) (← links)
