
The P versus NP–complete dichotomy of some challenging problems in graph theory
Keywords: تجزیه و تحلیل الگوریتم ها و پیچیدگی مشکل; Analysis of algorithms and problem complexity; Graph algorithms; Structural characterization of types of graphs