Bijective proofs of two broken circuit theorems

Authors:

Abstract
We prove, by means of explicit bijections, theorems of Whitney and Stanley that express the coefficients of the chromatic polynomial of a graph G and the number of acyclic orientations of G in terms of numbers of sets of edges that contain no broken circuits of G.

This publication has 3 references indexed in Scilit: