3 papers
math.CO2022
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…
cs.CG2016
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…
math.CO2010
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…