Proving a conjecture on chromatic polynomials by counting the number of acyclic orientations

DOI10.1002/jgt.22617zbMath1521.05054arXiv1803.08658WikidataQ122877602 ScholiaQ122877602MaRDI QIDQ6055397

No author found.

Publication date: 29 September 2023

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

Full work available at URL: https://arxiv.org/abs/1803.08658

zbMATH Keywords

combinatorial interpretationchromatic polynomialacyclic orientation

Mathematics Subject Classification ID

Graph polynomials (05C31) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• On rigid circuit graphs
• Combinatorial reciprocity for the chromatic polynomial and the chromatic symmetric function
• Sinks in acyclic orientations of graphs
• Incidence matrices and interval graphs
• The Tutte polynomial
• Acyclic orientations of graphs
• On the Interpretation of Whitney Numbers Through Arrangements of Hyperplanes, Zonotopes, Non-Radon Partitions, and Orientations of Graphs
• Broken-Cycle-Free Subgraphs and the Log-Concavity Conjecture for Chromatic Polynomials
• An introduction to chromatic polynomials
• A Contribution to the Theory of Chromatic Polynomials

This page was built for publication: Proving a conjecture on chromatic polynomials by counting the number of acyclic orientations