The convex dimension of a graph

DOI10.1016/j.dam.2007.02.005zbMath1278.90339OpenAlexW2119321729MaRDI QIDQ997061

Shmuel Onn, Uriel G. Rothblum, Nir Halman

Publication date: 19 July 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2007.02.005

zbMATH Keywords

discrete geometrygraph embeddingconvex combinatorial optimization

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (6)

Drawing graphs with vertices and edges in convex position ⋮ On the largest convex subsets in Minkowski sums ⋮ Convexly independent subsets of Minkowski sums of convex polygons ⋮ The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores theorem ⋮ Constrained Minkowski sums: A geometric framework for solving interval problems in computational biology efficiently ⋮ A \(\tau \)-conjecture for Newton polygons

Cites Work

• Unnamed Item
• A quantitative Steinitz' theorem
• Convex combinatorial optimization
• Lectures on Polytopes

This page was built for publication: The convex dimension of a graph