Heawood proved that every planar graph with no 1-cycles is vertex 5colorable, which is equivalent to the statement that every planar graph with no 1-bonds has a nowhere-zero 5-flow. Tutte has conjectured that every graph with no 1-bonds has a nowhere-zero 5-flow. We show that Tutte's 5-Flow Conjectu
โฆ LIBER โฆ
Tutte's 5-flow conjecture for graphs of nonorientable genus 5
โ Scribed by Steffen, Eckhard
- Publisher
- John Wiley and Sons
- Year
- 1996
- Tongue
- English
- Weight
- 577 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
โฆ Synopsis
We develop four constructions for nowhere-zero 5-flows of 3-regular graphs that satisfy special structural conditions. Using these constructions we show a minimal counterexample to Tutte's 5-Flow Conjecture is of order 244 and therefore every bridgeless graph of nonorientable genus 5 5 has a nowhere-zero 5-flow.
One of the structural properties is formulated in terms of the structure of the multigraph G ( F ) obtained from a given 3-regular graph G by contracting the cycles of a 2-factor F in G.
๐ SIMILAR VOLUMES
Tutte's 5-flow conjecture for the projec
โ
Richard Steinberg
๐
Article
๐
1984
๐
John Wiley and Sons
๐
English
โ 300 KB