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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.