Gauss codes, planar hamiltonian graphs, and stack-sortable permutations
References (12)
- et al.
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
J. Comput. System Sci.
(1976) - et al.
Queues, stacks, and graphs
- et al.
On imbedding graphs in the sphere
J. Math. Mech.
(1961) Charactérisation des symboles corisés de genre nul.
C. R. Acad. Sci. Paris
(1972)Über Kombinatorische Topologie
Acta Math.
(1936)- H. de Fraysseix and P. Rosenstiehl, The left-right algorithm for planarity testing and embedding, submitted for...
There are more references available in the full text version of this article.
Cited by (33)
Meanders: A personal perspective to the memory of Pierre Rosenstiehl
2023, European Journal of CombinatoricsPermutations sortable by two stacks in parallel and quarter plane walks
2015, European Journal of CombinatoricsOn Crossing Sets, Disjoint Sets, and Pagenumber
2000, Journal of AlgorithmsGraphs with E Edges Have Pagenumber O(√E)
1994, Journal of AlgorithmsDescribing realizable Gauss diagrams using the concepts of parity or bipartite graphs
2023, Journal of Knot Theory and its Ramifications
Copyright © 1984 Published by Elsevier Inc.