6 papers
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.
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…
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…