Skip to main content
. Author manuscript; available in PMC: 2016 Oct 31.
Published in final edited form as: Electron J Comb. 2015;22(3):P3.43.

Table 1.

Computer calculations of possible genus ranges of graphs with n vertices.

𝒢ℛn :
n = 2 {0}, {1}.
n = 3 {0}, {1}, {0, 1}, {1, 2}.
n = 4 {0}, {1}, {0, 1}, {1, 2}, {0, 1, 2}.
n = 5 {0}, {1}, {2}, {0, 1}, {1, 2}, {2, 3}, {0, 1, 2}, {1, 2, 3}.
n = 6 {0}, {1}, {2}, {3}, {0, 1}, {1, 2}, {2, 3}, {0, 1, 2}, {1, 2, 3}, {0, 1, 2, 3}.
n = 7 {0}, {1}, {2}, {3}, {0, 1}, {1, 2}, {2, 3}, {3, 4}, {0, 1, 2}, {1, 2, 3}, {2, 3, 4}, {0, 1, 2, 3}, {1, 2, 3, 4}.