The dimension of a graph

Abstract For each graph G the dimension of G is defined as the smallest dimension in the Euclidean Space where there is an embedding in which all the edges of G are segments of a straight line of length one. The exact value is calculated for some important families of graphs and this value is compared with other invariants. An infinite quantity of forbidden graphs for dimension 2 is also shown.

[1]  K. Wagner.  Bemerkungen zum Vierfarbenproblem. , 1936 .

[2]  G. Ringel,et al.  Solution of the heawood map-coloring problem. , 1968, Proceedings of the National Academy of Sciences of the United States of America.

[3]  K. Appel,et al.  Every planar map is four colorable. Part I: Discharging , 1977 .

[4]  K. Appel,et al.  Every Planar Map Is Four Colorable , 2019, Mathematical Solitaires & Games.