The convex dimension of a graph

DOI10.1016/J.DAM.2007.02.005MaRDI QIDQ997061zbMATH OpenOpenAlexFDO

Authors Nir Halman, Shmuel Onn, Uriel G. Rothblum

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

convex combinatorial optimizationdiscrete geometrygraph embedding

Mathematics Subject Classification ID

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

Recommendations

• Drawing graphs with vertices and edges in convex position
• Drawing graphs with vertices and edges in convex position
• Involving \(d\)-convex simple and quasi-simple planar graphs in \(\mathbb R^3\)
• The dimension of a graph
• scientific article; zbMATH DE number 1439489

Cites work

• A quantitative Steinitz' theorem
• Convex combinatorial optimization
• scientific article; zbMATH DE number 446693 (Why is no real title available?)
• Lectures on Polytopes

Cited in

(9)

• Constrained Minkowski sums: A geometric framework for solving interval problems in computational biology efficiently
• Convexly independent subsets of Minkowski sums of convex polygons
• The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores theorem
• A \(\tau \)-conjecture for Newton polygons
• On the largest convex subsets in Minkowski sums
• Drawing graphs with vertices and edges in convex position
• scientific article; zbMATH DE number 4130418 (Why is no real title available?)
• Drawing graphs with vertices and edges in convex position
• scientific article; zbMATH DE number 108143 (Why is no real title available?)

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

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