2 citations · 2 across the 4 of their papers we have counts for
5 papers
The DP Color Function of Clique-Gluings of Graphs
Hemanshu Kaul, Michael Maxfield, Jeffrey A. Mudrock +1
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řák and Postle in 2…
Non-chromatic-adherence of the DP Color Function via Generalized Theta Graphs
Manh Vu Bui, Hemanshu Kaul, Michael Maxfield +3
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řák and Postle in 2…
The DP Color Function of Joins and Vertex-Gluings of Graphs
Jack Becker, Jade Hewitt, Hemanshu Kaul +5
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řák and Postle in 2…
On Polynomial Representations of the DP Color Function: Theta Graphs and Their Generalizations
Charlie Halberg, Hemanshu Kaul, Andrew Liu +3
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řák and Postle in 2…
Answers to Two Questions on the DP Color Function
Jeffrey A. Mudrock, Seth Thomason
DP-coloring is a generalization of list coloring that was introduced in 2015 by Dvořák and Postle. The chromatic polynomial of a graph is a notion that has been extensively studied…