Signed graphs with two negative edges
Combinatorics
2016-04-28 v1
Abstract
The presented paper studies the flow number of flow-admissible signed graphs with two negative edges. We restrict our study to cubic graphs, because for each non-cubic signed graph there is a set of cubic graphs such that . We prove that if contains a bridge and in general. We prove better bounds, if there is an element of which satisfies some additional conditions. In particular, if is bipartite, then and the bound is tight. If is 3-edge-colorable or critical or if it has a sufficient cyclic edge-connectivity, then . Furthermore, if Tutte's 5-Flow Conjecture is true, then admits a nowhere-zero 6-flow endowed with some strong properties.
Keywords
Cite
@article{arxiv.1604.08053,
title = {Signed graphs with two negative edges},
author = {Edita Rollová and Michael Schubert and Eckhard Steffen},
journal= {arXiv preprint arXiv:1604.08053},
year = {2016}
}