Null genus realizability criterion for abstract intersection sequences

George K. Francis

Research output: Contribution to journalArticle

Abstract

The plane realizability problem for an abstract signed intersection sequence is solved by a twelve-instruction finite-decision algorithm.

Original languageEnglish (US)
Pages (from-to)331-341
Number of pages11
JournalJournal of Combinatorial Theory
Volume7
Issue number4
DOIs
StatePublished - Dec 1969

Fingerprint Dive into the research topics of 'Null genus realizability criterion for abstract intersection sequences'. Together they form a unique fingerprint.

  • Cite this