(Almost-)Optimal FPT Algorithm and Kernel for $T$-Cycle on Planar Graphs

Harmender Gahlawat, Abhishek Rathod, Meirav Zehavi

Research of cycles through specific vertices is a central topic in graph theory. In this context, we focus on a well-studied computational problem, \textsc{$T$-Cycle}: given an und…