Gauss codes, planar hamiltonian graphs, and stack-sortable permutations
From MaRDI portal
Publication:3716310
DOI10.1016/0196-6774(84)90018-XzbMath0588.68034WikidataQ60638468 ScholiaQ60638468MaRDI QIDQ3716310
Pierre Rosenstiehl, Robert Endre Tarjan
Publication date: 1984
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(84)90018-x
68P10: Searching and sorting
68R10: Graph theory (including graph drawing) in computer science
05C10: Planar graphs; geometric and topological aspects of graph theory
05C45: Eulerian and Hamiltonian graphs
Related Items
Permutations sortable by two stacks in parallel and quarter plane walks, Permutations generated by stacks and deques, Representations of graphs and networks (coding, layouts and embeddings), Facilities layout generalized model solved by n-boundary shortest path heuristics, Finding and counting permutations via CSPs, Characterizations of Deque and Queue Graphs, Amortized Computational Complexity