The structure of graphs with a vital linkage of order 2
Combinatorics
2011-07-19 v2
Abstract
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.
Cite
@article{arxiv.1006.5485,
title = {The structure of graphs with a vital linkage of order 2},
author = {Dillon Mayhew and Geoff Whittle and Stefan H. M. van Zwam},
journal= {arXiv preprint arXiv:1006.5485},
year = {2011}
}
Comments
6 pages, 4 figures