On the Maximum Number of Vertices of Critically Embedded Graphs

zbMath1323.05041arXiv0910.2469MaRDI QIDQ3447862

Yashar Memarian

Publication date: 28 October 2015

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

zbMATH Keywords

critical graphsmaximum number of vertices

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (4)

Example of a nontrivial irreducible geodesic net in the plane ⋮ Geodesic Nets: Some Examples and Open Problems ⋮ On critical nets in \({\mathbb{R}}^k\) ⋮ Geodesic nets with three boundary vertices

This page was built for publication: On the Maximum Number of Vertices of Critically Embedded Graphs