2010/06/29 by Dillon Mayhew, Mayhew, Dillon, Geoff Whittle +3
Computer Science · Mathematics · #05C75 #05C83 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Interconnection Networks and Systems #math.CO #msc:05C75 #msc:05C83
paper · pdf · doi:10.48550/arxiv.1006.5485
6 pages, 4 figures
openalex publication_date 2010/06/29 · arxiv created 2011/07/18 · arxiv updated 2011/07/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01
A linkage of order k of a graph G is a subgraph with k components, each of which is a path. A linkage is vital if it spans all vertices, and no other linkage connects the same pairs of end vertices. We give a characterization of the graphs with a vital linkage of order 2: they are certain minors of a family of highly structured graphs.