Reports
Enumeration of Non-Separable Graphs on Fewer than Ten Points ; CU-CS-005-72 Public Deposited
https://scholar.colorado.edu/concern/reports/bn999756p
- 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.
- Creator
- Date Issued
- 1972-09-01
- Academic Affiliation
- Last Modified
- 2019-12-21
- Resource Type
- Rights Statement
- Language
Relationships
Items
Thumbnail | Title | Date Uploaded | Visibility | Actions |
---|---|---|---|---|
enumerationOfNonSeparableGraphsOnFewerThanTenPointsCu.pdf | 2019-12-21 | Public | Download |