Bijective proofs of two broken circuit theorems

DOI10.1002/jgt.3190100104zbMath0592.05022OpenAlexW1998144063WikidataQ114236090 ScholiaQ114236090MaRDI QIDQ3720619

Andreas Blass, Bruce E. Sagan

Publication date: 1986

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190100104

zbMATH Keywords

chromatic polynomialacyclic orientationsbroken circuits

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (11)

Increasing spanning forests in graphs and simplicial complexes ⋮ A bibliography on chromatic polynomials ⋮ The amazing chromatic polynomial ⋮ The active bijection for graphs ⋮ \(G\)-parking functions, acyclic orientations and spanning trees ⋮ A chromatic symmetric function in noncommuting variables ⋮ Acyclic orientation polynomials and the sink theorem for chromatic symmetric functions ⋮ A bijection for Eulerian-equivalence classes of totally cyclic orientations ⋮ Recursion relations for chromatic coefficients for graphs and hypergraphs ⋮ Bijective Proofs of Proper Coloring Theorems ⋮ Sinks in acyclic orientations of graphs

This page was built for publication: Bijective proofs of two broken circuit theorems