References
- Appel K, Haken W. Every planar map is four colorable. I. Discharging. Illinois J Math. 1977;21(3):429–490.
- Appel K, Haken W. Every planar map is four colorable. Providence (RI): American Mathematical Society; 1989. (Contemporary mathematics; vol. 98). With the collaboration of J. Koch.
- Appel K, Haken W, Koch J. Every planar map is four colorable. II. Reducibility. Illinois J Math. 1977;21(3):491–567.
- Tutte WT. A contribution to the theory of chromatic polynomials. Canadian J Math. 1954;6:80–91. doi: 10.4153/CJM-1954-010-9
- Seymour PD. Nowhere-zero flows. In: Handbook of combinatorics. Vol. 1, 2. Amsterdam: Elsevier; 1995. p. 289–299. Appendix: colouring, stable sets and perfect graphs.
- Seymour PD. Nowhere-zero 6-flows. J Combin Theory Ser B. 1981;30(2):130–135. doi: 10.1016/0095-8956(81)90058-7
- Akbari S, Ghareghani N, Khosrovshahi GB, et al. On zero-sum 6-flows of graphs. Linear Algebra Appl. 2009;430(11–12):3047–3052. doi: 10.1016/j.laa.2009.01.027
- Bouchet A. Nowhere-zero integral flows on a bidirected graph. J Combin Theory Ser B. 1983;34(3):279–292. doi: 10.1016/0095-8956(83)90041-2
- Akbari S, Daemi A, Hatami O, et al. Zero-sum flows in regular graphs. Graphs Combin. 2010;26(5):603–615. doi: 10.1007/s00373-010-0946-5
- Akbari S, Ghareghani N, Khosrovshahi GB, et al. A note on zero-sum 5-flows in regular graphs. Electron J Combin. 2012;19(2): Paper 7, 5.
- Akbari S, Kano M, Zare S. 0-sum and 1-sum flows in regular graphs. Electron J Combin. 2016;23(2): Paper 37, 10.
- Zare S. Nowhere-zero flows in graphs and hypergraphs [PhD thesis]. Tehran, Iran: Amirkabir University of Technology; 2013 Feb. (Persian).
- DeVos M. Flows on bidirected graphs, 2013. arXiv:1310.8406
- Akbari S, Khosrovshahi GB, Mofidi A. Zero-sum flows in designs. J Combin Des. 2011;19(5):355–364. doi: 10.1002/jcd.20289
- Akbari S, Burgess AC, Danziger P, et al. Zero-sum flows for Steiner triple systems. Discrete Math. 2017;340(3):416–425. doi: 10.1016/j.disc.2016.08.014
- Sarkis G, Shahriari S, and PCURC. Zero-sum flows of the linear lattice. Finite Fields Appl. 2015;31:108–120. PCURC stands for the Pomona College Undergraduate Research Circle whose members for this project were D. Breese, B. Fish, I. Juarez, U. Kothari, S. Ragain, C. Ruberman, A. Sarkar, and Z. Siegel. doi: 10.1016/j.ffa.2014.09.001
- Godsil C, Royle G. Algebraic graph theory. New York: Springer-Verlag; 2001. (Graduate texts in mathematics; vol. 207).
- Schrijver A. Combinatorial optimization: polyhedra and efficiency. Vol. A. Berlin: Springer-Verlag; 2003. (Algorithms and combinatorics; vol. 24). Paths, flows, matchings, Chapters 1–38.
- Bondy JA, Murty USR. Graph theory. New York: Springer; 2008. (Graduate texts in mathematics; vol. 244).
- Villarreal RH. Rees algebras of edge ideals. Commun Algebra. 1995;23(9):3513–3524. doi: 10.1080/00927879508825412
- Akbari S, Ghareghani N, Khosrovshahi GB, et al. The kernels of the incidence matrices of graphs revisited. Linear Algebra Appl. 2006;414(2–3):617–625. doi: 10.1016/j.laa.2005.11.004
- Fouquet JL. On nowhere-zero flows in bidirected graphs. Theorie algebrique des graphes. Table ronde, Le Mans, 1984 Sept 5–11, abstract.
- Zýka O. Nowhere-zero 30-flow on bidirected graphs [PhD thesis]. Praha: Charles University; 1987. KAM-DIMATIA Series 87–26.
- Fowler T. Unique coloring of planar graphs [PhD thesis]. Georgia Institute of Technology; 1998.
- West DB. Introduction to graph theory. Vol. 2. Upper Saddle River: Prentice hall; 2001.