On two dual classes of planar graphs

Graph Theory with Applications

E. Kay, J. A. Bondy, U. S. R. Murty · Operational Research Quarterly (1970-1977) · 1977 · 3K citations

Computing, Computer Science, Mathematics +12

Efficient Planarity Testing

John E. Hopcroft, Robert E. Tarjan · Journal of the ACM · 1974 · 1.1K citations · Full text

Computing, Computer Science, Mathematics +13

Linear-time computability of combinatorial problems on series-parallel graphs

K. Takamizawa, Takao Nishizeki, Naobumi Saito · Journal of the ACM · 1982 · 285 citations · Full text

Computing, Computer Science, Mathematics +9

Steiner trees, partial 2–trees, and minimum IFI networks

Joseph A. Wald, Charles J. Colbourn · Networks · 1983 · 212 citations

Computing, Computer Science, Computer Networks +11

Characterization and Recognition of Partial 3-Trees

Stefan Arnborg, Andrzej Proskurowski · SIAM Journal on Algebraic and Discrete Methods · 1986 · 171 citations

Computing, Computer Science, Algorithms +11