Bijective proofs of two broken circuit theorems
作者:
Andreas Blass,
Bruce Eli Sagan,
期刊:
Journal of Graph Theory
(WILEY Available online 1986)
卷期:
Volume 10,
issue 1
页码: 15-21
ISSN:0364-9024
年代: 1986
DOI:10.1002/jgt.3190100104
出版商: Wiley Subscription Services, Inc., A Wiley Company
数据来源: WILEY
摘要:
AbstractWe prove, by means of explicit bijections, theorems of Whitney and Stanley that express the coefficients of the chromatic polynomial of a graphGand the number of acyclic orientations ofGin terms of numbers of sets of edges that contain no broken circuits ofG.
点击下载:
PDF
(362KB)
返 回