论文信息 - A cubic 3-connected graph having no cycle through given 10 vertices has the "Petersen form" - 字舞流文

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

It has been proved [1,2] that in a cubic 3-connected graph any 9 vertices lie on a common cycle.

M. V. Lomonosov | Alexander Kelmans

[1] Alexander K. Kelmans,et al. When m vertices in a k-connected graph cannot be walked round along a simple cycle , 1982, Discret. Math..