Reconstructing surface triangulations by their intersection matrices

DOI10.7151/DMGT.1816zbMATH Open1317.05034OpenAlexW2963606722MaRDI QIDQ2516675FDOQ2516675

Authors Jorge L. Arocha, Isabel Hubard, Javier Bracho, Natalia García-Colín

Publication date 4 August 2015

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1402.6012

zbMATH Keywords

isomorphismtriangulated surfaceintersection matrix

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)

Abstract: The intersection matrix of a finite simplicial complex has as each of its entries the rank of the intersection of its respective simplices. We prove that such matrix defines the triangulation of a closed connected surface up to isomorphism.

Recommendations

• A characterization of triangulations of closed surfaces
• On triangulations of surfaces
• Decomposition and Enumeration of Triangulated Surfaces
• scientific article; zbMATH DE number 4163744
• Surface realization with the intersection segment functional

Cites work

• A simple way to tell a simple polytope from its graph
• Lectures on Polytopes
• On Polyhedral Embeddings of Cubic Graphs
• Puzzles and polytope isomorphisms

Cited in

(4)

• scientific article; zbMATH DE number 5239222 (Why is no real title available?)
• Elementary moves on triangulations
• Regridding surface triangulations
• A characterization of triangulations of closed surfaces

This page was built for publication: Reconstructing surface triangulations by their intersection matrices

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