Abstract

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

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.