Ronald J. Gould, Alexandr V. Kostochka, Gexin Yu. On Minimum Degree Implying That a Graph is H-Linked. SIAM J. Discrete Math., 20(4):829-840, 2006. [doi]
@article{GouldKY06,
title = {On Minimum Degree Implying That a Graph is H-Linked},
author = {Ronald J. Gould and Alexandr V. Kostochka and Gexin Yu},
year = {2006},
doi = {10.1137/050624662},
url = {http://dx.doi.org/10.1137/050624662},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/GouldKY06},
cites = {0},
citedby = {0},
journal = {SIAM J. Discrete Math.},
volume = {20},
number = {4},
pages = {829-840},
}