References
- I. Averbouch, B. Godlin, and J.A. Makowsky, A most general edge elimination polynomial, In: International Workshop on Graph-Theoretic Concepts in Computer Science, pp. 31–42, Springer, New York, 2008. doi: 10.1007/978-3-540-92248-3_4
- I. Averbouch, B. Godlin, and J.A. Makowsky, An extension of the bivariate chromatic polynomial, Europ. J. Combin. 31 (2010), 1–17. doi: 10.1016/j.ejc.2009.05.006
- R. Balakrishnan and K. Ranganathan, A textbook of graph theory, Springer Science and Business Media, New York, 2012.
- M. Biehler, Sur une classe dequations algebriques dont toutes les racines sont reelles, J. Reine Angew. Math. 87 (1879), 350–352.
- N. Biggs, Algebraic Graph Theory, Cambridge University Press, Cambridge, 1974.
- J.A. Bondy and U.S.R. Murty, Graph theory with applications, American Elsevier Publishing Co. Inc., New York, 1976.
- G. Chartrand and F. Harary, Planar permutation graphs, Ann. Inst. Henri Poincaré Probab. Stat. 3(4) (1967), 433–438.
- G.L. Chia, A bibliography on chromatic polynomials, Discrete Math. 172 (1997), 175–191. doi: 10.1016/S0012-365X(97)90031-5
- T. Estermann, Complex numbers and functions, University of London, The Athlone Press, 1962.
- C.D. Godsil and I. Gutman, On the theory of the matching polynomial, J. Graph Theory 5(2) (1981), 137–144. doi: 10.1002/jgt.3190050203
- H. Hajiabolhassan and M.L. Mehrabadi, On clique polynomials, Australas. J. Comb. 18 (1998), 313–316.
- C. Hermite, Sur les nombre des racines dune equation algebrique comprise entre des limites donnees, J. Reine Angew. Math. 52 (1856), 39–51.
- O. Herscovici, J.A. Makowsky, and V. Rakita, Harary Polynomials, Enumerative Combinatorics and Applications 1(2) (2020), Article #S2R13, see also arXiv preprint arXiv:2003.06250. doi: 10.54550/ECA2021V1S2R13
- T. Kotek, J.A. Makowsky, and B. Zilber, On counting generalized colorings, In: Computer Science Logic, M. Kaminski and S Martini, (eds.), CSL 2008, Lecture Notes in Computer Science, Vol. 5213, Springer, Berlin/Heidelberg, 1970. https://doi.org/10.1007/978−3−540−87531−4−25
- J.A. Makowsky and V. Rakita, Almost unimodal and real-rooted graph polynomials, European J. Combinatorics, 108, February 2023, https://doi.org/10.1016/j.ejc.2022.103637
- J.A. Makowsky, E.V. Ravve, and T. Kotek, A logician’s view of graph polynomials, Ann. Pure Appl. Log. 170 (2017), 1030–1069. doi: 10.1016/j.apal.2019.04.007
- M.R. Oboudi, On the roots of domination polynomial of graphs, Discret. Appl. Math. 205 (2016), 126–131. doi: 10.1016/j.dam.2015.12.010
- E. Sperner, Ein satz uber untermengen einer endlichen menge, Math. Zeit. 27 (1928), 544–548. doi: 10.1007/BF01171114