5-cycles and the Petersen graph
classification
💻 cs.DM
keywords
graphcyclespetersenbridgelesscomprisedconnectedcubicevery
read the original abstract
We show that if G is a connected bridgeless cubic graph whose every 2-factor is comprised of cycles of length five then G is the Petersen graph.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.