Drawing a graph in a hypercube
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Special sequences and polynomials (11B83) Graph theory (including graph drawing) in computer science (68R10)
Summary: A \(d\)-dimensional hypercube drawing of a graph represents the vertices by distinct points in \(\{0,1\}^d\), such that the line-segments representing the edges do not cross. We study lower and upper bounds on the minimum number of dimensions in hypercube drawing of a given graph. This parameter turns out to be related to Sidon sets and antimagic injections.
This page was built for publication: Drawing a graph in a hypercube
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2500992)