4 citations · 9 across the 32 of their papers we have counts for
3 papers · 1 filter
A Polynomial Method for Counting Colorings of Sparse Graphs
Samantha L. Dahlberg, Hemanshu Kaul, Jeffrey A. Mudrock
The notion of -labeling of graphs, where is a subset of a symmetric group, was introduced in 2019 by Jin, Wong, and Zhu. This notion provides the framework for a common gene…
DP-Coloring of Graphs from Random Covers
Anton Bernshteyn, Daniel Dominik, Hemanshu Kaul +1
DP-coloring (also called correspondence coloring) of graphs is a generalization of list coloring that has been widely studied since its introduction by Dvořák and Postle in .…
An Improved Algorithm for Finding Maximum Outerplanar Subgraphs
Gruia Calinescu, Hemanshu Kaul, Bahareh Kudarzi
We study the NP-complete Maximum Outerplanar Subgraph problem. The previous best known approximation ratio for this problem is 2/3. We propose a new approximation algorithm which i…