2011/09/15 by Michael Ferrara, Ronald J. Gould, Ronald Gould +6 · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Graph theory and applications #Interconnection Networks and Systems
paper · doi:10.1002/jgt.20632
openalex publication_date 2011/09/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/23
Abstract For a fixed (multi)graph H , a graph G is H‐linked if any injection f : V ( H )→ V ( G ) can be extended to an H ‐subdivision in G . The notion of an H ‐linked graph encompasses several familiar graph classes, including k ‐linked, k ‐ordered and k ‐connected graphs. In this article, we give two sharp Ore‐type degree sum conditions that assure a graph G is H ‐linked for arbitrary H . These results extend and refine several previous results on H ‐linked, k ‐linked, and k ‐ordered graphs. © 2011 Wiley Periodicals, Inc. J Graph Theory 71:69–77, 2012