Bijective Proofs of Proper Coloring Theorems

DOI10.1080/00029890.2021.1901460zbMath1465.05069arXiv2007.13725OpenAlexW3172205299WikidataQ113853673 ScholiaQ113853673MaRDI QIDQ4991610

Bruce E. Sagan, Vincent R. Vatter

Publication date: 3 June 2021

Published in: The American Mathematical Monthly (Search for Journal in Brave)

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

zbMATH Keywords

chromatic polynomialchromatic symmetric function

Mathematics Subject Classification ID

Graph polynomials (05C31) Symmetric functions and generalizations (05E05) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

The amazing chromatic polynomial

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphs with equal chromatic symmetric functions
• Enumeration of Golomb rulers and acyclic orientations of mixed graphs
• On weak chromatic polynomials of mixed graphs
• A symmetric function generalization of the chromatic polynomial of a graph
• Acyclic orientations of graphs
• Milnor numbers of projective hypersurfaces and the chromatic polynomial of graphs
• Unimodality, log-concavity, real-rootedness and beyond
• Bijective proofs of two broken circuit theorems
• Graph colorings and acyclic orientations
• Algebraic Graph Theory
• On an Algorithm for Comparing the Chromatic Symmetric Functions of Trees
• Enumeration of Mixed Graphs
• An introduction to chromatic polynomials
• Chromatic Polynomials
• Combinatorial reciprocity theorems

This page was built for publication: Bijective Proofs of Proper Coloring Theorems