Abstract
Let be four vertices in a graph . A \emph{-minor rooted} at consists of four pairwise-disjoint pairwise-adjacent connected subgraphs of , respectively containing . We characterise precisely when contains a -minor rooted at by describing six classes of obstructions, which are the edge-maximal graphs containing no -minor rooted at . The following two special cases illustrate the full characterisation: (1) A 4-connected non-planar graph contains a -minor rooted at for every choice of . (2) A 3-connected planar graph contains a -minor rooted at if and only if are not on a single face.
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.