Counting Methods for Nowhere-Zero Flows - Kochol, Martin
32,99 €
inkl. MwSt.
Versandkostenfrei*
Versandfertig in 6-10 Tagen
payback
16 °P sammeln
  • Broschiertes Buch

Flows in graphs present an important topic in modern mathematics with many applications in practice and a significant impact on many problems from discrete mathematics. Nowhere-zero flow in graphs present a dual concept for graph coloring problems. We apply methods of linear algebra for nowhere-zero flow problems. We present several results regarding the 5-flow conjecture. In particular, we give restrictions regarding cyclical edge connectivity and girth for a smallest counterexample to the conjecture. We present also application for edge-coloring of planar cubic graphs. Furthermore we present…mehr

Andere Kunden interessierten sich auch für
Produktbeschreibung
Flows in graphs present an important topic in modern mathematics with many applications in practice and a significant impact on many problems from discrete mathematics. Nowhere-zero flow in graphs present a dual concept for graph coloring problems. We apply methods of linear algebra for nowhere-zero flow problems. We present several results regarding the 5-flow conjecture. In particular, we give restrictions regarding cyclical edge connectivity and girth for a smallest counterexample to the conjecture. We present also application for edge-coloring of planar cubic graphs. Furthermore we present a decomposition formula for flow polynomials on graphs. The book is devoted for graduate students and researchers dealing with combinatorics.
Autorenporträt
Graduate and undergraduate study mathematics. JSPS Postdoctoral Fellowship in Japan and Alexander von Humboldt Fellowship in Germany. Currently Principal Research Fellow at MU SAV.