There Are No Cubic Graphs on 26 Vertices with Crossing Number 10 or 11

We show that no cubic graphs of order 26 have crossing number larger than 9, which proves a conjecture of Ed Pegg Jr and Geoffrey Exoo that the smallest cubic graphs with crossing number 11 have 28 vertices. This result is achieved by first eliminating all girth 3 graphs from consideration, and then...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Graphs and combinatorics 2020-11, Vol.36 (6), p.1713-1721
Hauptverfasser:	Clancy, Kieran, Haythorpe, Michael, Newcombe, Alex, Pegg, Ed
Format:	Artikel
Sprache:	eng
Schlagworte:	Apexes Combinatorics Engineering Design Graph theory Graphs Mathematics Mathematics and Statistics Original Paper
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!