2 citations · 2 across the 8 of their papers we have counts for
12 papers
Flexible list colorings: Maximizing the number of requests satisfied
Hemanshu Kaul, Rogers Mathew, Jeffrey A. Mudrock +1
Flexible list coloring was introduced by Dvořák, Norin, and Postle in 2019. Suppose , is a graph, is a list assignment for , and is a function with n…
Strong Hanani-Tutte for the Torus
Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer
If a graph can be drawn on the torus so that every two independent edges cross an even number of times, then the graph can be embedded on the torus.
On Equitable List Arboricity of Graphs
Hemanshu Kaul, Jeffrey A. Mudrock, Michael J. Pelsmajer
Equitable list arboricity, introduced by Zhang in 2016, generalizes the notion of equitable list coloring by requiring the subgraph induced by each color class to be acyclic (inste…
Partial DP-Coloring
Hemanshu Kaul, Jeffrey A. Mudrock, Michael J. Pelsmajer
In 1980, Albertson and Berman introduced partial coloring. In 2000, Albertson, Grossman, and Haas introduced partial list coloring. Here, we initiate the study of partial coloring…
A Simple Characterization of Proportionally 2-choosable Graphs
Hemanshu Kaul, Jeffrey A. Mudrock, Michael J. Pelsmajer +1
We recently introduced proportional choosability, a new list analogue of equitable coloring. Like equitable coloring, and unlike list equitable coloring (a.k.a. equitable choosabil…
Proportional Choosability: A New List Analogue of Equitable Coloring
Hemanshu Kaul, Jeffrey A. Mudrock, Michael J. Pelsmajer +1
In 2003, Kostochka, Pelsmajer, and West introduced a list analogue of equitable coloring called equitable choosability. In this paper, we motivate and define a new list analogue of…
Total Equitable List Coloring
Hemanshu Kaul, Jeffrey A. Mudrock, Michael J. Pelsmajer
An equitable coloring is a proper coloring of a graph such that the sizes of the color classes differ by at most one. A graph is equitably -colorable if there exists an equi…
Hanani-Tutte for Radial Planarity II
Radoslav Fulek, Michael Pelsmajer, Marcus Schaefer
A drawing of a graph is radial if the vertices of are placed on concentric circles with common center , and edges are drawn radially: every edge inter…
Statistical models for cores decomposition of an undirected random graph
Vishesh Karwa, Michael J. Pelsmajer, Sonja Petrović +2
The -core decomposition is a widely studied summary statistic that describes a graph's global connectivity structure. In this paper, we move beyond using -core decomposition…
Finding minors in graphs with a given path structure
André Kündgen, Michael J. Pelsmajer, Radhika Ramamurthi
Given graphs G and H with V(G) containing V(H), suppose that we have a u,v-path P_{uv} in G for each edge uv in H. There are obvious additional conditions that ensure that G contai…
Dominating Sets in Triangulations on Surfaces
Hong Liu, Michael J. Pelsmajer
A dominating set D of a graph G is a set such that each vertex v of G is either in the set or adjacent to a vertex in the set. Matheson and Tarjan (1996) proved that any n-vertex p…
Dominating Sets in Plane Triangulations
Erika L. C. King, Michael J. Pelsmajer
In 1996, Matheson and Tarjan conjectured that any n-vertex triangulation with n sufficiently large has a dominating set of size at most n/4. We prove this for graphs of maximum deg…