Embeddings of graphs into Euclidean space under which the number of points that belong to a hyperplane is minimal

DOI10.1070/SM2012V203N10ABEH004273zbMATH Open1258.05083MaRDI QIDQ4907598

K. I. Oblakov, T. A. Oblakova

Publication date: 4 February 2013

Published in: Sbornik: Mathematics (Search for Journal in Brave)

zbMATH Keywords

hyperplanegraph embeddings

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (3)

Finite Transitive Graph Embeddings into a Hyperbolic Metric Space Must Stretch or Squeeze ⋮ Graphs embedded in the plane with a bounded number of accumulation points ⋮ Title not available (Why is that?)

This page was built for publication: Embeddings of graphs into Euclidean space under which the number of points that belong to a hyperplane is minimal

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