Evaluations of the circuit partition polynomial
Abstract
J. A. Ellis-Monaghan (1998, J. Combin. Theory Ser. B 74, 326-352) used Hopf algebra techniques to prove some beautiful combinatorial interpretations of the Martin polynomial for unoriented graphs. Our aim here is to give very simple proofs of similar interpretations for a considerably wider class of values. The results look particularly simple when formulated for a trivial transform of the Martin polynomial, the circuit partition polynomial. © 2002 Elsevier Science (USA).
Publication Title
Journal of Combinatorial Theory. Series B
Recommended Citation
Bollobás, B. (2002). Evaluations of the circuit partition polynomial. Journal of Combinatorial Theory. Series B, 85 (2), 261-268. https://doi.org/10.1006/jctb.2001.2102
COinS
