Abstract A geodesic dominated coloring of a graph G is a proper coloring in which each color class is dominated by at least one geodesic. The minimum number of colors required for such a coloring is ...

Annie Zeng, Undergraduate Student Siebel School of Computing and Data Science, University of Illinois Urbana-Champaign (UIUC) The list coloring problem on graphs is where each vertex has a list of ...

Optimization Investigates both applied and applicable mathematics and statistical techniques Explore open-access research on optimization theory and applications, advancing algorithms and models for ...