An excluded minor theorem for the Wagner graph plus an edge
Combinatorics
2022-06-09 v1
Abstract
Let denote the unique graph obtained from the Wagner graph, also known as , by adding an edge between two vertices of distance 3 on the Hamilton cycle, which is exactly a split of a minor of the Petersen graph. A complete characterization of all internally 4-connected graphs with no minor is given in [J. Maharry and N. Robertson, The structure of graphs not topologically containing the Wagner graph, J. Combin. Theory Ser. B 121 (2016) 398-420]. In this paper we characterize all internally 4-connected graphs with no minor.
Keywords
Cite
@article{arxiv.2206.03571,
title = {An excluded minor theorem for the Wagner graph plus an edge},
author = {Yuqi Xu and Weihua Yang},
journal= {arXiv preprint arXiv:2206.03571},
year = {2022}
}
Comments
27 pages