Non-chromatic-adherence of the DP color function via generalized theta graphs

DOI10.1007/s00373-023-02633-zOpenAlexW3206326906MaRDI QIDQ2701400

Paul Shin, Jeffrey A. Mudrock, Michael Maxfield, Seth Thomason, Manh Vu Bui, Hemanshu Kaul

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

zbMATH Keywords

chromatic polynomialrearrangement inequalitycorrespondence coloringDP-coloringDP color function

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Combinatorial inequalities (05A20) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

On the list color function threshold ⋮ An algebraic approach for counting DP-3-colorings of sparse graphs ⋮ DP color functions versus chromatic polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• Classifying coloring graphs
• When does the list-coloring function of a graph equal its chromatic polynomial
• Sum-paintability of generalized theta-graphs
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• The chromatic polynomial and list colorings
• DP-3-coloring of some planar graphs
• Properly edge-colored theta graphs in edge-colored complete graphs
• A note on the DP-chromatic number of complete bipartite graphs
• On the chromatic roots of generalized theta graphs
• Combinatorial Nullstellensatz and DP-coloring of graphs
• Answers to two questions on the DP color function
• On list equitable total colorings of the generalized theta graph
• DP color functions versus chromatic polynomials
• A deletion-contraction relation for 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
• The asymptotic behavior of the correspondence chromatic number
• On the number of list‐colorings
• Sharp Dirac's theorem for DP‐critical graphs
• Packing Coloring of Undirected and Oriented Generalized Theta Graphs
• Chromatic Roots are Dense in the Whole Complex Plane
• On rearrangement inequalities for multiple sequences
• GRACEFUL LABELING OF HANGING THETA GRAPHS
• The Johansson‐Molloy theorem for DP‐coloring
• A note on a Brooks' type theorem for DP‐coloring
• Two New Inequalities
• Asymptotically good edge correspondence colourings

This page was built for publication: Non-chromatic-adherence of the DP color function via generalized theta graphs