Non-chromatic-adherence of the DP Color Function via Generalized Theta Graphs

DP-coloring (also called correspondence coloring) is a generalization of list coloring that has been widely studied in recent years after its introduction by Dvoř\'{a}k and Postle in 2015. The chromatic polynomial of a graph is an extensively studied notion in combinatorics since its introducti...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2021-10
Hauptverfasser:	Manh Vu Bui, Kaul, Hemanshu, Maxfield, Michael, Mudrock, Jeffrey A, Shin, Paul, Thomason, Seth
Format:	Artikel
Sprache:	eng
Schlagworte:	Color Coloring Combinatorial analysis Graphs Polynomials
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!