Nowhere-zero flows in signed graphs: A survey
arXiv:1608.06944
Abstract
We survey known results related to nowhere-zero flows and related topics, such as circuit covers and the structure of circuits of signed graphs. We include an overview of several different definitions of signed graph colouring.
References in corpus (9)
- The complexity of signed graph and edge-coloured graph homomorphisms
- Flows on Bidirected Graphs
- Homomorphisms of signed planar graphs
- Shortest circuit covers of signed graphs
- Nowhere-zero flows on signed eulerian graphs
- Chromatic number of signed graphs with bounded maximum degree
- Signed graphs with two negative edges
- Classification of Indecomposable Flows of Signed Graphs
- Nowhere-zero 9-flows in 3-edge-connected signed graphs