A sequence representation for maps

DOI10.1016/0012-365X(80)90232-0MaRDI QIDQ1154473zbMATH OpenFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3882458 (Why is no real title available?)
• scientific article; zbMATH DE number 3679848 (Why is no real title available?)
• scientific article; zbMATH DE number 3512154 (Why is no real title available?)
• scientific article; zbMATH DE number 3358033 (Why is no real title available?)
• An n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-container
• The nonorientable genus of 𝐾_{𝑛}

Cited in

(11)

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

This page was built for publication: A sequence representation for maps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1154473)