HOMEOMORPHISM OF 2-COMPLEXES IS EQUIVALENT TO GRAPH ISOMORPHISM

DOI10.1142/S0218195900000279zbMath0968.68168OpenAlexW2096005399MaRDI QIDQ4762909

No author found.

Publication date: 22 February 2001

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195900000279

zbMATH Keywords

graph isomorphism2-complex homeomorphism

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

Unnamed Item ⋮ Unnamed Item

Cites Work

• Finite Surfaces a Study of Finite 2-Complexes
• Finite Surfaces. A Study of Finite 2-Complexes

This page was built for publication: HOMEOMORPHISM OF 2-COMPLEXES IS EQUIVALENT TO GRAPH ISOMORPHISM