Author:
Cutler Jonathan,Pebody Luke
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference9 articles.
1. The vertex independence sequence of a graph is not constrained;Alavi;Congr. Numer.,1987
2. Generalized covering designs and clique coverings;Bailey;J. Combin. Des.,2011
3. A bipartite graph with non-unimodal independent set sequence;Bhattacharyya;Electron. J. Combin.,2013
4. On the shape of a pure O-sequence;Boij;Mem. Amer. Math. Soc.,2012
5. Roots of independence polynomials of well covered graphs;Brown;J. Algebraic Combin.,2000
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Almost unimodal and real-rooted graph polynomials;European Journal of Combinatorics;2023-02
2. Independence Polynomials of Bipartite Graphs;Bulletin of the Malaysian Mathematical Sciences Society;2022-06-09
3. Independent set and matching permutations;Journal of Graph Theory;2021-07-27
4. The Roller-Coaster Conjecture Revisited;Graphs and Combinatorics;2017-08-11