Geometrical embeddings of graphs
- 1 January 1989
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 74 (3) , 291-319
- https://doi.org/10.1016/0012-365x(89)90142-8
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Embedding the n-cube in Lower DimensionsEuropean Journal of Combinatorics, 1986
- On combinatorial properties of spheres in euclidean spacesCombinatorica, 1984
- Space graphs and sphericityDiscrete Applied Mathematics, 1984
- Triangle free graphs that are not 3-embeddable in SdJournal of Combinatorial Theory, Series B, 1982
- The Complexity of the Partial Order Dimension ProblemSIAM Journal on Algebraic Discrete Methods, 1982
- On the Shannon capacity of a graphIEEE Transactions on Information Theory, 1979
- A triangle free graph which cannot be imbedded in any euclidean unit sphereJournal of Combinatorial Theory, Series A, 1978
- On embedding triangle-free graphs in unit spheresDiscrete Mathematics, 1977
- Aggregation of Inequalities in Integer ProgrammingPublished by Elsevier ,1977
- On the dimension of a graphMathematika, 1965