DP color functions versus chromatic polynomials

DOI10.1016/j.aam.2021.102301zbMath1481.05028arXiv2105.11081OpenAlexW4205724841MaRDI QIDQ2070081

Yan Yang, Fengming Dong

Publication date: 21 January 2022

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

cyclespanning treechromatic polynomialproper coloringlisting coloringDP-coloringDP color function

Mathematics Subject Classification ID

Trees (05C05) Graph polynomials (05C31) Enumeration in graph theory (05C30)

Related Items (4)

DP color functions versus chromatic polynomials (II) ⋮ DP‐coloring Cartesian products of graphs ⋮ An algebraic approach for counting DP-3-colorings of sparse graphs ⋮ Non-chromatic-adherence of the DP color function via generalized theta graphs

Cites Work

• When does the list-coloring function of a graph equal its chromatic polynomial
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• On rigid circuit graphs
• The chromatic polynomial and list colorings
• Answers to two questions on the DP color function
• The DP color function of joins and vertex-gluings of graphs
• On the chromatic polynomial and counting DP-colorings of graphs
• DP-colorings of graphs with high chromatic number
• Non-chromatic-adherence of the DP color function via generalized theta graphs
• A Proof of a Conjecture of Ohba
• An introduction to chromatic polynomials
• Chromatic Polynomials
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: DP color functions versus chromatic polynomials