Generalized Chromatic Polynomials of Cycles and uni-cyclic Graphs
Dipnit Biswas, R. Venkatesh
Abstract
In R81, Read obtained an explicit formula for the generalized chromatic polynomials of cycle graphs using the classical deletion-contraction principle. In this paper, we take a linear-algebraic approach and present a new proof of Read's formula by realizing the generalized chromatic polynomials of cycle graphs as traces of certain linear operators. As an application of this approach, we also derive explicit formulas for the generalized chromatic polynomials of uni-cyclic graphs.
Create a lesson
Related papers
Clique partitions and distinct color sets in list colorings
Jun Yue
The parity of the number of missing integers in partitions
Julia Q. D. Du, Gurinder Singh
Three-critical hypergraphs of maximum local edge connectivity two
Jun Yue
A Murnaghan--Nakayama rule for dual stable Grothendieck functions
Dang Tuan Hiep, Do Le Hai Thuy
On the classification of 2-distance-primitive graphs of small valency
Xing Zhang, Xue Wang, Jun-Jie Huang
Anti-ribbon shaped Young diagram decomposition
Hideki Murahara, Maki Nakasuji, Wataru Takeda