pith. sign in

arxiv: 1102.3760 · v1 · pith:2W6B2YCDnew · submitted 2011-02-18 · 🧮 math.CO

Rooted K₄-Minors

classification 🧮 math.CO
keywords rootedminorconnectedcontainsgraphcontainingfourcases
0
0 comments X
read the original abstract

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

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.