paper

An excluded minor theorem for the 6-wheel

arXiv:2605.15125

Abstract

For each integer , the wheel graph is defined as the graph obtained by connecting a single vertex to all vertices of a cycle of length . In particular, can be uniquely obtained from the Petersen graph by contracting three edges incident to a common vertex. Gubser provided a characterization of all 3-connected planar -minor-free graphs. In this paper, we complete the characterization of -minor-free graphs by determining the 3-connected nonplanar cases.

34 pages, 20 figures

An excluded minor theorem for the 6-wheel · wovepaper