#### Title

Graph Linkedness With Prescribed Lengths

#### Document Type

Article

#### Publication Date

6-2016

#### Publication Title

International Journal of Graph Theory and its Applications

#### Abstract

Given a multigraph H, a graph G is H-linked if every injective map f : V (H) -> V (G) can be extended to an H-subdivision (f,g) in G for some g. Given a multigraph H and an integer sequence w = {we | e 2 E(H), we 2}, a graph G is (H, w, m)-linked if every injective map f : V (H) -> V (G) can be extended to an H-subdivision (f,g) in G such that each path g(e) has length we ,..., or we + m. If m = 0, then we say G is (H, w)-linked. We show that the sharp minimum degree condition for a graph to be H-linked is the same as the sharp minimum degree condition for a large graph to be (H, w, m)-linked for m 1 and all sets w with each value we 2 w at least 14. Additionally, we establish a sharp minimum degree condition for a large graph to be (H, w)-linked.

#### Recommended Citation

Coll, Vincent E. Jr., Alexander Halperin, Colton Magnant.
2016.
"Graph Linkedness With Prescribed Lengths."
*International Journal of Graph Theory and its Applications*, 2 (1): 1-21.
source: https://pdfs.semanticscholar.org/545f/c4b1ace883e03c0537fd0164e3e82cc97380.pdf

https://digitalcommons.georgiasouthern.edu/math-sci-facpubs/589