Ultimate chromatic polynomials
Nigel Ray,William Schmitt +1 more
1
TL;DR: An approach to enumeration problems which relies on the algebra of free abelian groups, giving as the main application a generalisation of the chromatic polynomial of a simple graph G, and extending the whole construction to incorporate the corresponding incidence Hopf algebras.
read more
About: This article is published in Discrete Mathematics. The article was published on 15 Feb 1994. and is currently open access. The article focuses on the topics: Monic polynomial & Matrix polynomial.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A bibliography on chromatic polynomials
TL;DR: This bibliography is intended to make this bibliography as complete as possible but in a work of this type, errors would inevitably have crept in, and it is asked for your indulgence and also your help in sending us those references that are not recorded here.
References
Algebraic graph theory
Norman Biggs
- 16 May 1974
TL;DR: In this article, the authors introduce algebraic graph theory and show that the spectrum of a graph can be modelled as a graph graph, and the spectrum can be represented as a set of connected spanning trees.
3.2K
Coalgebras and Bialgebras in Combinatorics
TL;DR: The following material is discussed in this article : Incidence coalgebras for PO sets, reduced Boolean coalgegebra, Dirichlet coalgebra, Eulerian coalgebra and Faa di Bruno Bialgebra.
483