Hamiltonian circuits and path coverings of vertices in graphs
Sharp sufficient conditions for Hamiltonian cycles in tough graphs
Hamiltonian shortage, path partitions of vertices, and matchings in a graph
On the locally Hamiltonian graphs and Kuratowski’s theorem
The article contains no abstract
On the maximal planar graphs and the four colour problem
The article contains no abstract
Page 1