167 results on '"Kochol, Martin"'
Search Results
2. Polynomials Counting Nowhere-Zero Chains Associated with Homomorphisms.
3. Interpretations of the Tutte and characteristic polynomials of matroids
4. Modifications of Tutte-Grothendieck invariants and Tutte polynomials
5. Interpretations of the Tutte polynomials of regular matroids
6. One-to-one correspondence between interpretations of the Tutte polynomials
7. Edge cut splitting formulas for Tutte–Grothendieck invariants
8. Linear Algebraic Relations among Cardinalities of Sets of Matroid Functions
9. Dichotomy for Coloring of Dart Graphs
10. Reductions of Matrices Associated with Nowhere-Zero Flows
11. 3-Regular Non 3-Edge-Colorable Graphs with Polyhedral Embeddings in Orientable Surfaces
12. Polynomial algorithms for canonical forms of orientations
13. Approximation Algorithm for Chromatic Index and Edge-Coloring of Multigraphs
14. Linear Algorithm for 3-Coloring of Locally Connected Graphs
15. Polyhedral Embeddings of Snarks in Orientable Surfaces
16. Polynomials Counting Nowhere-Zero Chains in Graphs
17. Linear algebraic approach to an edge-coloring result
18. Smallest counterexample to the 5-flow conjecture has girth at least eleven
19. Restrictions On Smallest Counterexamples To The 5-Flow Conjecture
20. Colorability of Planar Graphs with Isolated Nontriangular Faces
21. A Theorem About Elementary Cuts and Flow Polynomials
22. 3-Regular Non 3-Edge-Colorable Graphs with Polyhedral Embeddings in Orientable Surfaces
23. Equivalent versions of group-connectivity theorems and conjectures
24. Modifications of Tutte–Grothendieck invariants and Tutte polynomials
25. Approximation Algorithm for Chromatic Index and Edge-Coloring of Multigraphs
26. Decomposition formulas for the flow polynomial
27. Covering planar graphs with forests
28. Linear Algorithm for 3-Coloring of Locally Connected Graphs
29. Snarks and flow-snarks constructed from coloring-snarks
30. Tension-flow polynomials on graphs
31. Reduction of the 5-Flow Conjecture to cyclically 6-edge-connected snarks
32. Varieties of modularp-algebras not containingM 3,3
33. Three colorability characterized by shrinking of locally connected subgraphs into triangles
34. Modifications of Tutte–Grothendieck invariants and Tutte polynomials
35. Interpretations of the Tutte and characteristic polynomials of matroids
36. Superposition and Constructions of Graphs Without Nowhere-zero k-flows
37. Equivalences between hamiltonicity and flow conjectures, and the sublinear defect property
38. A note on the arboricity of graphs
39. Stable dominating circuits in snarks
40. Coefficients of chromatic polynomials and tension polynomials
41. Three measures of edge-uncolorability
42. Polynomial algorithms for canonical forms of orientations
43. Counting nowhere-zero flows on wheels
44. Non-extendible latin parallelepipeds
45. Linear algebraic approach to an edge-coloring result
46. Brooksʼ Theorem for generalized dart graphs
47. Matrix reduction in a combinatorial computation
48. Three measures of edge-uncolorability
49. Complexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surface
50. Approximation of 3-Edge-Coloring of Cubic Graphs
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.