A minimum-vertex triangulation

DOI10.1016/0095-8956(78)90043-6zbMath0311.05106OpenAlexW1995914090MaRDI QIDQ1219296

John Philip Huneke

Publication date: 1978

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(78)90043-6

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (10)

Locally Hamiltonian graphs and minimal size of maximal graphs on a surface ⋮ Face distributions of embeddings of complete graphs ⋮ Edge‐maximal graphs on orientable and some nonorientable surfaces ⋮ Minimal triangulations on orientable surfaces ⋮ The covering type of closed surfaces and minimal triangulations ⋮ On topological minors in random simplicial complexes ⋮ On the connectivity of graphs embedded in surfaces ⋮ Simultaneous current graph constructions for minimum triangulations and complete graph embeddings ⋮ Finite commutative rings with higher genus unit graphs ⋮ Nonexistence of weakly neighborly polyhedral maps on the orientable 2- manifold of genus 2

Cites Work

• Unnamed Item
• Unnamed Item
• Wie man die geschlossenen nichtorientierbaren Flächen in möglichst wenig Dreiecke zerlegen kann
• A lower bound for crossing numbers of graphs with application to \(K_n\),\(K_{pq}\)g, and \(Q(d)\)
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM

This page was built for publication: A minimum-vertex triangulation