References
- Biermann, J., O’Keefe, A., Van Tuyl, A. (2017). Bounds on the regularity of toric ideals of graphs. Adv. Appl. Math. 85:84–102. DOI: 10.1016/j.aam.2016.11.003..
- Eisenbud, D. (2005). The Geometry of Syzygies. A Second Course in Commutative Algebra and Algebraic Geometry, Graduate Texts in Mathematics, 229. New York: Springer-Verlag.
- Ene, V., Herzog, J. (2012). Gröbner bases in Commutative Algebra, Graduate Studies in Mathematics, 130. Providence, RI: American Mathematical Society.
- Favacchio, G., Keiper, G., Van Tuyl, A. (2020). Regularity and h-polynomials of toric ideals of graphs. Proc. Amer. Math. Soc. 148(11):4665–4677. DOI: 10.1090/proc/15126..
- Frank, A. (1993). Conservative weightings and ear-decompositions of graphs. Combinatorica 13(1):65–81. DOI: 10.1007/BF01202790..
- Geelen, J., Kapadia, R. (2018). Computing girth and cogirth in perturbed graphic matroids. Combinatorica 38(1):167–191. DOI: 10.1007/s00493-016-3445-3..
- González, M., Rentería, C., Sarmiento, E. (2013). Parameterized codes over some embedded sets and their applications to complete graphs. Math. Commun. 18(2):377–391.
- Guan, M. (1960). Graphic programming using odd or even points. Acta Math. Sinica 10:263–266.
- Hà, H. T., Beyarslan, S. K., O’Keefe, A. (2019). Algebraic properties of toric rings of graphs. Commun. Algebra 47(1):1–16. DOI: 10.1080/00927872.2018.1439047..
- Herzog, J., Hibi, T. (2011). Monomial ideals. Graduate Texts in Mathematics, 260. London: Springer-Verlag.
- Herzog, J., Hibi, T., (2020). The regularity of edge rings and matching numbers. Mathematics 8:39. DOI: 10.3390/math8010039..
- Korte, B., Vygen, J. (2006). Combinatorial optimization. Theory and Algorithms, 3rd ed. Algorithms and Combinatorics, 21. Berlin: Springer-Verlag.
- Neves, J., Vaz Pinto, M., Villarreal, R. H. (2020). Joins, Ears and Castelnuovo-Mumford regularity. J. Algebra 560:67–88. DOI: 10.1016/j.jalgebra.2020.05.014..
- Rentería, C., Simis, A., Villarreal, R. H. (2011). Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields. Finite Fields Appl. 17(1):81–104. DOI: 10.1016/j.ffa.2010.09.007.
- Schrijver, A. (2003). Combinatorial optimization. Polyhedra and efficiency — Vol. A. Paths, flows, matchings. Chapters 1–38, Algorithms and Combinatorics, 24, A. Berlin: Springer-Verlag.
- Simis, A., Vasconcelos, V., Villarreal, R. H. (1994). On the ideal theory of graphs. J. Algebra 167(2):389–416. DOI: 10.1006/jabr.1994.1192.
- Solé, P., Zaslavsky, T. (1993). The covering radius of the cycle code of a graph. Discrete Appl. Math. 45(1):63–70. DOI: 10.1016/0166-218X(93)90140-J.
- Villarreal, R. H. (1995). Rees algebras of edge ideals. Commun. Algebra 23(9):3513–3524. DOI: 10.1080/00927879508825412..
- Villarreal, R. H. (2015). Monomial Algebras, 2nd ed. Monographs and Research Notes in Mathematics. Boca Raton, FL: CRC Press, xviii, 686 p.