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

DOI10.1002/jgt.3190060415zbMath0496.05033OpenAlexW2124571105MaRDI QIDQ3960873

Michael V. Lomonosov, Alexander K. Kelmans

Publication date: 1982

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190060415

zbMATH Keywords

Petersen graphcubic 3-connected graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Related Items (3)

The ubiquitous Petersen graph ⋮ Cycles through ten vertices in 3-connected cubic graphs ⋮ On cycles through prescribed vertices in weakly separable graphs

This page was built for publication: A cubic 3-connected graph having no cycle through given 10 vertices has the “Petersen form”