Planar graphs without cycles of length from 4 to 7 are proved to be 3-colorable. Moreover, it is proved that each proper 3-coloring of a face of length from 8 to 11 in a connected plane graph withoutâ€¦ (More)

A cyclic colouring of a plane graph is a vertex colouring such that vertices incident with the same face have distinct colours. The minimum number of colours in a cyclic colouring of a graph is itsâ€¦ (More)

Measurable parameters of NMR-relaxation (spin-lattice relaxation time T 1 and sp in-sp in relaxation time T 2 of water protons) are known to depend on the nature, concentration, hydration, andâ€¦ (More)

In this paper we present two new polynomial algorithms for the asymmetric version of the m-Peripatetic Salesman Problem (m-APSP) which consists in finding m edge-disjoint Hamiltonian circuits ofâ€¦ (More)

Interest in the study of nuclear magnetic relaxation (NMR) of blood and biological fluids [2, 11] is due to the wide opportunities presented by the method for studying the properties of blood and itsâ€¦ (More)