2 citations · 4 across the 34 of their papers we have counts for
7 papers · 1 filter
Shameful Inequalities for List and DP Coloring of Graphs
Hemanshu Kaul, Jeffrey A. Mudrock, Gunjan Sharma
The chromatic polynomial of a graph is an important notion in algebraic combinatorics that was introduced by Birkhoff in 1912; denoted , it equals the number of proper -…
Maximizing Satisfied Vertex Requests in List Coloring
Timothy Bennett, Michael C. Bowdoin, Haley Broadus +5
Suppose is a graph and is a list assignment for . A request of is a function with nonempty domain such that for each .…
Counting List Colorings of Unlabeled Graphs
Hemanshu Kaul, Jeffrey A. Mudrock
The classic enumerative functions for counting colorings of a graph , such as the chromatic polynomial , do so under the assumption that the given graph is labeled. In 1…
On strongly and robustly critical graphs
Anton Bernshteyn, Hemanshu Kaul, Jeffrey A. Mudrock +1
In extremal combinatorics, it is common to focus on structures that are minimal with respect to a certain property. In particular, critical and list-critical graphs occupy a promin…
On Polynomial Representations of Dual DP Color Functions
Jeffrey A. Mudrock, Gabriel Sharbel
DP-coloring (also called correspondence coloring) is a generalization of list coloring that was introduced by Dvořák and Postle in 2015. The chromatic polynomial of a graph is an i…
On the Ohba Number and Generalized Ohba Numbers of Complete Bipartite Graphs
Kennedy Cano, Emily Gutknecht, Gautham Kappaganthula +3
We say that a graph is chromatic-choosable when its list chromatic number is equal to its chromatic number . Chromatic-choosability is a well-studied topic,…
Counting Packings of List-colorings of Graphs
Hemanshu Kaul, Jeffrey A. Mudrock
Given a list assignment for a graph, list packing asks for the existence of multiple pairwise disjoint list colorings of the graph. Several papers have recently appeared that study…