Gauss codes, planar hamiltonian graphs, and stack-sortable permutations
- 1 September 1984
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 5 (3) , 375-390
- https://doi.org/10.1016/0196-6774(84)90018-x
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976
- A forbidden substructure characterization of Gauss codesBulletin of the American Mathematical Society, 1976
- Efficient Planarity TestingJournal of the ACM, 1974
- Über kombinatorische TopologieActa Mathematica, 1936