The structure of graphs with a vital linkage of order 2

Details The structure of graphs with a vital linkage of order 2 The structure of graphs with a vital linkage of order 2

2010-06-29

arxiv.org/abs/1006.5485v2

Mathematics

Combinatorics

6 pages, 4 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The structure of graphs with a vital linkage of order 2 does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The structure of graphs with a vital linkage of order 2, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The structure of graphs with a vital linkage of order 2 will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-313992