2 papers
cs.DS2020
Minimum Weight Pairwise Distance Preservers
Mojtaba Abdolmaleki, Yafeng Yin, Neda Masoud
In this paper, we study the Minimum Weight Pairwise Distance Preservers (MWPDP) problem. Consider a positively weighted undirected/directed connected graph and a su…
math.CO2017
On uniquely k-list colorable planar graphs, graphs on surfaces, and regular graphs
M. Abdolmaleki, J. P. Hutchinson, S. Gh. Ilchi +2
A graph is called uniquely k-list colorable (ULC) if there exists a list of colors on its vertices, say , each of size , such that…