Funder
Indian Institute of Science Education and Research Mohali
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference21 articles.
1. On the edge cover polynomial of a graph;Akbari;Eur. J. Comb.,2013
2. The Peterson recurrence formula for the chromatic discriminant of a graph;Arunkumar;Indian J. Pure Appl. Math.,2018
3. G. Arunkumar, Generalized chromatic polynomials of graphs from heaps of pieces, Arxiv, July 2019.
4. Root multiplicities for Borcherds algebras and graph coloring;Arunkumar;J. Algebra,2018
5. Generalized Kac-Moody algebras;Borcherds;J. Algebra,1988
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献