Abstract
In 1983, Bouchet proposed a conjecture that every flow-admissible signed graph admits a nowhere-zero 6-flow. Bouchet himself proved that such signed graphs admit nowhere-zero 216-flows and Zýka further proved that such signed graphs admit nowhere-zero 30-flows. In this paper we show that every flow-admissible signed graph admits a nowhere-zero 11-flow.
| Original language | English |
|---|---|
| Pages (from-to) | 198-221 |
| Number of pages | 24 |
| Journal | Journal of Combinatorial Theory. Series B |
| Volume | 149 |
| DOIs | |
| Publication status | Published - Jul 2021 |
| Externally published | Yes |
Keywords
- Balanced Z×Z-NZF
- Integer flow
- Modulo flow
- Signed graph
Fingerprint
Dive into the research topics of 'Flows on flow-admissible signed graphs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver