Rooted $K_4$-Minors
Combinatorics
2013-10-02 v1
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.
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}
}