4 citations · 9 across the 32 of their papers we have counts for
4 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 -…
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…
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…