Bijective proofs of two broken circuit theorems
Authors:
- 1 March 1986
- journal article
- Published by Wiley in Journal of Graph Theory
- Vol. 10 (1) , 15-21
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.Keywords
This publication has 3 references indexed in Scilit:
- Acyclic orientations of graphsDiscrete Mathematics, 1973
- GRAPH THEORY1969
- A logical expansion in mathematicsBulletin of the American Mathematical Society, 1932