4 citations · 9 across the 32 of their papers we have counts for
3 papers · 1 filter
List Coloring the Cartesian Product of a Complete Graph and Complete Bipartite Graph
Hemanshu Kaul, Leonardo Marciaga, Jeffrey A. Mudrock
We study the list chromatic number of the Cartesian product of a complete graph of order and a complete bipartite graph with partite sets of size and , denoted $χ_{\ell}…
On the DP-chromatic Number of Cartesian Products of Critical Graphs
Hemanshu Kaul, Jeffrey A. Mudrock, Gunjan Sharma
DP-coloring (also called correspondence coloring) is a well-studied generalization of list coloring introduced by Dvořák and Postle in 2015. The following sharp bound on the DP-chr…
A Spectral Turán Problem for a Fixed Tree
Dheer Noal Desai, Hemanshu Kaul, Bahareh Kudarzi
We study the spectral Turán problem for trees. To avoid limiting our perspective to specific families of trees, we parametrize trees in terms of their unique bipartition. We say $T…