A POLYNOMIAL ALGORITHM FOR FINDING THE MINIMUM FEEDBACK VERTEX SET OF A 3-REGULAR SIMPLE GRAPH 1

The Rectilinear Steiner Tree Problem is $NP$-Complete

M. R. Garey, David S. Johnson · SIAM Journal on Applied Mathematics · 1977 · 1.1K citations

Natural Sciences, Computer Science, Mathematics +12

How to determine the maximum genus of a graph

Nguyen Huy Xuong · Journal of Combinatorial Theory Series B · 1979 · 176 citations

Natural Sciences, Anatomy, Combinatorics +5

On feedback vertex sets and nonseparating independent sets in cubic graphs

Ewald Speckenmeyer · Journal of Graph Theory · 1988 · 53 citations

Computing, Computer Science, Algorithms +7

A Kuratowski-type theorem for the maximum genus of a graph

E. A. Nordhaus, Richard D. Ringeisen, B. M. Stewart et al. · Journal of Combinatorial Theory Series B · 1972 · 42 citations

Natural Sciences, Biology, Combinatorics +4

A new bound on the feedback vertex sets in cubic graphs

Jiping Liu, Cheng Zhao · Discrete Mathematics · 1996 · 28 citations

Computing, Computer Science, Mathematics +8