Almost unimodal and real-rooted graph polynomials
From MaRDI portal
Publication:2107505
DOI10.1016/j.ejc.2022.103637OpenAlexW3165153639MaRDI QIDQ2107505
Vsevolod Rakita, Johann A. Makowsky
Publication date: 1 December 2022
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.00268
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximal-clique partitions and the roller coaster conjecture
- The roots of the independence polynomial of a clawfree graph
- From a zoo to a zoology: Towards a general theory of graph polynomials
- On unimodal sequences of graphical invariants
- On the unimodality of independence polynomials of very well-covered graphs
- The zero forcing polynomial of a graph
- A logician's view of graph polynomials
- On the unimodality of domination polynomials
- Milnor numbers of projective hypersurfaces and the chromatic polynomial of graphs
- Unimodality, log-concavity, real-rootedness and beyond
- Introduction to Random Graphs
- VERY WELL-COVERED GRAPHS OF GIRTH AT LEAST FOUR AND LOCAL MAXIMUM STABLE SET GREEDOIDS
- Christoffel–Darboux Type Identities for the Independence Polynomial
- Unimodality of independence polynomials of rooted products of graphs
- Acyclic polynomials of graphs
- Sparse graphs: Metrics and random models
- An introduction to chromatic polynomials
- Polynomials
