Non-chromatic-adherence of the DP color function via generalized theta graphs
From MaRDI portal
Publication:2701400
DOI10.1007/s00373-023-02633-zMaRDI QIDQ2701400
Hemanshu Kaul, Jeffrey A. Mudrock, Seth Thomason, Paul Shin, Michael Maxfield, Manh Vu Bui
Publication date: 28 April 2023
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.04058
chromatic polynomial; rearrangement inequality; correspondence coloring; DP-coloring; DP color function
05C30: Enumeration in graph theory
05A20: Combinatorial inequalities
05C15: Coloring of graphs and hypergraphs
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)