Pages that link to "Item:Q3720619"

The following pages link to Bijective proofs of two broken circuit theorems (Q3720619):

Displaying 12 items.

• The active bijection for graphs (Q670651) (← links)
• \(G\)-parking functions, acyclic orientations and spanning trees (Q965998) (← links)
• A bijection for Eulerian-equivalence classes of totally cyclic orientations (Q1015438) (← links)
• The chromatic polynomial of an unlabeled graph (Q1059638) (← links)
• A bibliography on chromatic polynomials (Q1366790) (← links)
• Increasing spanning forests in graphs and simplicial complexes (Q1633617) (← links)
• Sinks in acyclic orientations of graphs (Q1850490) (← links)
• Recursion relations for chromatic coefficients for graphs and hypergraphs (Q2062676) (← links)
• Bijective Proofs of Proper Coloring Theorems (Q4991610) (← links)
• Acyclic orientation polynomials and the sink theorem for chromatic symmetric functions (Q5918292) (← links)
• A chromatic symmetric function in noncommuting variables (Q5939547) (← links)
• The amazing chromatic polynomial (Q6169806) (← links)