Optimal Embedding of Graphs with Nonconcurrent Longest Paths in Archimedean Tessellations

Table 1

Comparison of the orders of graphs.

Tessellations	Orders of 1-connected graphs		Orders of 2-connected graphs
	Given in [23]	Given here	Given in [23]	Given here
	62	32	152	144
	46	32	110	98
	48	32	110	88
(3.6.3.6)	92	56	278	180
(3.4.6.4)	100	52	224	180
	166	114	511	367
(4.6.12)	207	106	541	424
	191	152	499	481