English

Rooted $K_4$-Minors

Combinatorics 2013-10-02 v1

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.

Keywords

Cite

@article{arxiv.1102.3760,
  title  = {Rooted $K_4$-Minors},
  author = {Ruy Fabila-Monroy and David R. Wood},
  journal= {arXiv preprint arXiv:1102.3760},
  year   = {2013}
}
R2 v1 2026-06-21T17:28:17.102Z