5-cycles and the Petersen graph

5-cycles and the Petersen graph

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.

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: DeVos, Matt, Mkrtchyan, Vahan V, Petrosyan, Samvel S
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Discrete Mathematics
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
DOI:10.48550/arxiv.0801.3714