Complexity of Computing the Anti-Ramsey Numbers for Paths

Saeed Akhoondian Amiri, Alexandru Popa 0001, Mohammad Roghani, Golnoosh Shahkarami, Reza Soltani, Hossein Vahidi 0001. Complexity of Computing the Anti-Ramsey Numbers for Paths. In Javier Esparza, Daniel Král', editors, 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24-28, 2020, Prague, Czech Republic. Volume 170 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. [doi]

Abstract

Abstract is missing.