Pages that link to "Item:Q5952156"
From MaRDI portal
The following pages link to Acyclic orientations and the chromatic polynomial (Q5952156):
Displaying 33 items.
- Chip-firing game and a partial Tutte polynomial for Eulerian digraphs (Q276208) (← links)
- Complete oriented colourings and the oriented achromatic number (Q400508) (← links)
- Mehler formulae for matching polynomials of graphs and independence polynomials of clawfree graphs (Q412167) (← links)
- Enumeration of Golomb rulers and acyclic orientations of mixed graphs (Q456386) (← links)
- The algebra of set functions. II: An enumerative analogue of Hall's theorem for bipartite graphs (Q658003) (← links)
- The algebra of set functions. I: The product theorem and duality (Q658006) (← links)
- The active bijection for graphs (Q670651) (← links)
- Combinatorial reciprocity for the chromatic polynomial and the chromatic symmetric function (Q785786) (← links)
- Set maps, umbral calculus, and the chromatic polynomial (Q932680) (← links)
- A geometric approach to acyclic orientations (Q1047180) (← links)
- Graph coloring and monotone functions on posets (Q1069950) (← links)
- A generalized chromatic polynomial, acyclic orientations with prescribed sources and sinks, and network reliability (Q1210562) (← links)
- Variations sur le thème \({E+\overline {E} = XY}\) (Variations on the theme \({E+\overline {E} = XY})\) (Q1865262) (← links)
- Graphs determined by polynomial invariants (Q1885023) (← links)
- Counting extensional acyclic digraphs (Q1944136) (← links)
- Chromatic symmetric function of graphs from Borcherds algebras (Q2040502) (← links)
- Generalised chromatic polynomials of graphs from heaps of pieces (Q2155545) (← links)
- Counting colored planar maps: algebraicity results (Q2275895) (← links)
- Acyclic orientations of graphs. (Reprint) (Q2497989) (← links)
- Activity preserving bijections between spanning trees and orientations in graphs (Q2566282) (← links)
- Calculating the Euler characteristic of the moduli space of curves (Q2678453) (← links)
- Polychromatic Acyclic Tours in Colored Multigraphs (Q3328573) (← links)
- Bijective proofs of two broken circuit theorems (Q3720619) (← links)
- Graph colorings and acyclic orientations (Q3768909) (← links)
- (Q4495689) (← links)
- Counting faces of graphical zonotopes (Q4597494) (← links)
- Acyclic orientation polynomials and the sink theorem for chromatic symmetric functions (Q5918292) (← links)
- Acyclic orientation polynomials and the sink theorem for chromatic symmetric functions (Q5918952) (← links)
- Acyclic orientations and chromatic generating functions (Q5937454) (← links)
- Notes on acyclic orientations and the shelling lemma (Q5941497) (← links)
- Proper orientations and proper chromatic number (Q6038578) (← links)
- Proving a conjecture on chromatic polynomials by counting the number of acyclic orientations (Q6055397) (← links)
- Acyclic reorientation lattices and their lattice quotients (Q6644271) (← links)