Grinberg's criterion applied to some non-planar graphs by Chia, G.L., Thomassen, C.

“…Robertson ([3]) and independently, Bondy ([1]) proved that the generalized Petersen graph P(n,2) is non-hamiltonian if n == 5 (mod 6), while Thomason ([5]) proved that it has precisely 3 hamiltonian cycles if n == 3 (mod 6). The hamiltonian cycles in the remaining generalized Petersen graphs were enumerated by Schwenk ([4]). …”
Get full text

The maximum number of minimal codewords in long codes by Alahmadi, A., Aldred, R. E. L., de la Cruz, R., Solé, P., Thomassen, C.

“…We also conclude that an Eulerian (even and connected) graph has at most 2q−p cycles unless the graph is a subdivision of a 4-regular graph that is the edge-disjoint union of two Hamiltonian cycles, in which case it may have as many as 2q−p+p cycles.…”
Get full text
Get full text