A new approach to determine the minimal polynomials of binary modified de Bruijn sequences by Musthofa, Indah Emilia Wijayanti, Diah Junia Eksi Palupi, Ezerman, Martianus Frederic

Subjects: Get full text

Edge-dominating cycles, k-walks and Hamilton prisms in 2K2-free graphs by Mou, Gao, Pasechnik, Dmitrii V.

“…Furthermore, we prove that for any ϵ>0ϵ>0 every (1+ϵ)(1+ϵ)-tough 2K22K2-free graph is prism-Hamiltonian and give an effective construction of a Hamiltonian cycle in the corresponding prism, along with few other similar results.…”
Get full text
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