Bijective proofs of two broken circuit theorems

DOI10.1002/JGT.3190100104MaRDI QIDQ3720619zbMATH OpenOpenAlexWikidataFDO

Authors 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

acyclic orientationsbroken circuitschromatic polynomial

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Bijective proofs of proper coloring theorems
• A note on a broken-cycle theorem for hypergraphs
• An abstraction of Whitney's broken circuit theorem
• Graph colorings and acyclic orientations
• Acyclic orientations and the chromatic polynomial

Cited in

(18)

• A bijection for Eulerian-equivalence classes of totally cyclic orientations
• The chromatic polynomial of an unlabeled graph
• A bibliography on chromatic polynomials
• Increasing spanning forests in graphs and simplicial complexes
• Sinks in acyclic orientations of graphs
• Recursion relations for chromatic coefficients for graphs and hypergraphs
• A broken circuit model for chromatic homology theories
• Matroidal bijections between graphs
• A note on a broken-cycle theorem for hypergraphs
• Broken circuits in matroids -- Dohmen's inductive proof
• Calculation of chromatic polynomials by use of the broken-circuit modules
• An abstraction of Whitney's broken circuit theorem
• Bijective proofs of proper coloring theorems
• Acyclic orientation polynomials and the sink theorem for chromatic symmetric functions
• A chromatic symmetric function in noncommuting variables
• The amazing chromatic polynomial
• The active bijection for graphs
• G-parking functions, acyclic orientations and spanning trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3720619)