Intersecting 1-factors and nowhere-zero 5-flows
Combinatorics
2016-09-05 v1
Abstract
Let be a bridgeless cubic graph, and the minimum number such that two 1-factors of intersect in edges. A cyclically -edge-connected cubic graph has a nowhere-zero 5-flow if (1) and or (2) if
Keywords
Cite
@article{arxiv.1306.5645,
title = {Intersecting 1-factors and nowhere-zero 5-flows},
author = {Eckhard Steffen},
journal= {arXiv preprint arXiv:1306.5645},
year = {2016}
}
Comments
8 pages, 1 figure