{"title":"Enumeration of non-separable graphs","authors":"Robert W. Robinson","doi":"10.1016/S0021-9800(70)80089-8","DOIUrl":null,"url":null,"abstract":"<div><p>Non-separable graphs are enumerated, and also graphs without end-points. The basic enumeration tool is sums of cycle indices of automorphism groups.</p></div>","PeriodicalId":100765,"journal":{"name":"Journal of Combinatorial Theory","volume":"9 4","pages":"Pages 327-356"},"PeriodicalIF":0.0000,"publicationDate":"1970-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0021-9800(70)80089-8","citationCount":"62","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Theory","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0021980070800898","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 62
Abstract
Non-separable graphs are enumerated, and also graphs without end-points. The basic enumeration tool is sums of cycle indices of automorphism groups.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
