Acyclic orientations and the chromatic polynomial

DOI10.1006/eujc.2001.0537zbMath0990.05063OpenAlexW2004062999MaRDI QIDQ5952156

Bodo Lass

Publication date: 28 April 2002

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.2001.0537

zbMATH Keywords

chromatic polynomialacyclic orientations

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (17)

Chip-firing game and a partial Tutte polynomial for Eulerian digraphs ⋮ Graphs determined by polynomial invariants ⋮ Generalised chromatic polynomials of graphs from heaps of pieces ⋮ Calculating the Euler characteristic of the moduli space of curves ⋮ Mehler formulae for matching polynomials of graphs and independence polynomials of clawfree graphs ⋮ Counting extensional acyclic digraphs ⋮ The algebra of set functions. II: An enumerative analogue of Hall's theorem for bipartite graphs ⋮ The algebra of set functions. I: The product theorem and duality ⋮ Set maps, umbral calculus, and the chromatic polynomial ⋮ The active bijection for graphs ⋮ Counting colored planar maps: algebraicity results ⋮ Chromatic symmetric function of graphs from Borcherds algebras ⋮ Acyclic orientation polynomials and the sink theorem for chromatic symmetric functions ⋮ Acyclic orientation polynomials and the sink theorem for chromatic symmetric functions ⋮ Activity preserving bijections between spanning trees and orientations in graphs ⋮ Combinatorial reciprocity for the chromatic polynomial and the chromatic symmetric function ⋮ Variations sur le thème \({E+\overline {E} = XY}\) (Variations on the theme \({E+\overline {E} = XY})\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A noncommutative version of the matrix inversion formula
• Graph coloring and monotone functions on posets
• Graphical Eulerian numbers and chromatic generating functions
• Counting acyclic digraphs by sources and sinks
• \(q\)-enumeration of convex polyominoes
• A symmetric function generalization of the chromatic polynomial of a graph
• Sinks in acyclic orientations of graphs
• Combinatorial problems of commutation and rearrangements
• Acyclic orientations of graphs
• On the Interpretation of Whitney Numbers Through Arrangements of Hyperplanes, Zonotopes, Non-Radon Partitions, and Orientations of Graphs
• The chromatic generating function
• Expansions of Chromatic Polynomials and Log-Concavity
• A higher invariant for matroids
• Acyclic orientations and chromatic generating functions
• Counting domino tilings of rectangles via resultants

This page was built for publication: Acyclic orientations and the chromatic polynomial