A characterization of 4-connected graphs with no 6-wheel minor

Zijun Chen; Yuqi Xu; Weihua Yang

paper

A characterization of 4-connected graphs with no 6-wheel minor

arXiv:2605.15039

Abstract

For each integer $n \geq 3$ , let $W_{n}$ denote the wheel graph obtained by connecting a single vertex to all vertices of a cycle of length $n$ . In particular, $W_{6}$ is obtained from the Petersen graph by contracting three edges incident with a common vertex. In this paper, we determine all $4$ -connected graphs that do not contain $W_{6}$ as a minor.

arXiv comment15 pages, 8 figures