Generating All Planar 0-, 1-, 2-, 3-Connected Graphs

Peter Läuchli. Generating All Planar 0-, 1-, 2-, 3-Connected Graphs. In Hartmut Noltemeier, editor, Graphtheoretic Concepts in Computer Science, Proceedings of the International Workshop WG 80, Bad Honnef, Germany, June 15-18, 1980. Volume 100 of Lecture Notes in Computer Science, pages 379-382, Springer, 1980.

Abstract

Abstract is missing.