M. V. Lomonosov

According to our database, M. V. Lomonosov authored at least 4 papers between 1982 and 1983.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

1983

On cycles through prescribed vertices in weakly separable graphs.

Alexander K. Kelmans, M. V. Lomonosov

Discret. Math., 1983

On the planar integer two-flow problem.

M. V. Lomonosov

Comb., 1983

1982

A cubic 3-connected graph having no cycle through given 10 vertices has the "Petersen form".

Alexander K. Kelmans, M. V. Lomonosov

J. Graph Theory, 1982

When m vertices in a k-connected graph cannot be walked round along a simple cycle.

Alexander K. Kelmans, M. V. Lomonosov

Discret. Math., 1982