{"title":"Null genus realizability criterion for abstract intersection sequences","authors":"George K. Francis","doi":"10.1016/S0021-9800(69)80060-8","DOIUrl":null,"url":null,"abstract":"<div><p>The plane realizability problem for an abstract signed intersection sequence is solved by a twelve-instruction finite-decision algorithm.</p></div>","PeriodicalId":100765,"journal":{"name":"Journal of Combinatorial Theory","volume":"7 4","pages":"Pages 331-341"},"PeriodicalIF":0.0000,"publicationDate":"1969-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0021-9800(69)80060-8","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Theory","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0021980069800608","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11
Abstract
The plane realizability problem for an abstract signed intersection sequence is solved by a twelve-instruction finite-decision algorithm.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
