The Even-Path Problem in Directed Single-Crossing-Minor-Free Graphs

Archit Chauhan, Samir Datta, Chetan Gupta +1

Finding a simple path of even length between two designated vertices in a directed graph is a fundamental NP-complete problem known as the EvenPath problem. Nedev proved in 1999, t…