Minimum degree conditions for image-linked graphs Original Research Article

For a fixed multigraph H with vertices image, a graph G is H-linked if for every choice of vertices image in G, there exists a subdivision of H in G such that image is the branch vertex representing image (for all i). This generalizes the notions of image-linked, image-connected, and image-ordered graphs.