A sequence representation for maps

DOI10.1016/0012-365X(80)90232-0zbMath0465.05029MaRDI QIDQ1154473

Sóstenes Lins

Publication date: 1980

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

polynomial algorithmgraphs embedded in compact surfaces

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

From colored triangulations to framed link presentations of 3-manifolds by a polynomial algorithm, New dualities from old: generating geometric, Petrie, and Wilson dualities and trialities of ribbon graphs, On the number of genus embeddings of complete bipartite graphs, Graph-encoded maps, A Tutte polynomial for maps. II: The non-orientable case, Estimating the number of stable configurations for the generalized Thomson problem, Exponentially many maximum genus embeddings and genus embeddings for complete graphs, On the number of nonisomorphic orientable regular embeddings of complete graphs, Exponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs., Graph-encoded 3-manifolds, Combinatorics of orientation reversing polygons

Cites Work

• An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container
• The nonorientable genus of 𝐾_{𝑛}
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item