Skip to main content
Location of Repository

## Rooted $K_4$-Minors

### 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

Topics: Mathematics - Combinatorics
Year: 2011
OAI identifier: oai:arXiv.org:1102.3760
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
• http://arxiv.org/abs/1102.3760 (external link)
• ### Suggested articles

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.