@article {IOPORT.06053892,
    author       = {Ellingham, M.N. and Plummer, Michael D. and Yu, Gexin},
    title        = {Linkage for the diamond and the path with four vertices.},
    year         = {2012},
    journal      = {Journal of Graph Theory},
    volume       = {70},
    number       = {3},
    issn         = {0364-9024},
    pages        = {241-261},
    publisher    = {John Wiley \& Sons, New York, NY},
    doi          = {10.1002/jgt.20612},
    abstract     = {Summary: Given graphs $G$ and $H$, we say $G$ is $H$-linked if for every injective mapping $\ell : V(H) \to V(G)$, we can find a subgraph $H'$ of $G$ that is a subdivision of $H$ with $\ell (v)$ being the vertex of $H'$ corresponding to each vertex $v$ of $H$. In this article, we prove two results on $H$-linkage for 4-vertex graphs $H$. Goddard showed that 4-connected planar triangulations are 4-ordered, or in other words $C_{4}$-linked. We strengthen this by showing that 4-connected planar triangulations are ($K_{4} - e$)-linked. X. Yu characterized certain graphs related to $P_{4}$-linkage. We use his characterization to show that every 7-connected graph is $P_{4}$-linked, and to construct 6-connected graphs that are not $P_{4}$-linked.},
    identifier   = {06053892},
}