Document Type

Technical Report

Publication Date

Fall 9-1-1972

Abstract

Until recently, the number of non-separable graphs on seven or fewer points was known due to hand computations carried out by DeRocco [1]. By implementing an algorithm of Robinson [2] on a digital computer we were able to compute the number of non-separable graphs on nine or fewer points. this paper presents these numbers.

Share

COinS