Name
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. © 2012 Wiley Periodicals, Inc. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1002/jgt.20640 | Journal of Graph Theory |
Keywords | DocType | Volume |
certain minor,k component,wiley periodicals,vital linkage,order k,graph g,end vertex | Journal | 71 |
Issue | ISSN | Citations |
2 | 0364-9024 | 0 |
PageRank | References | Authors |
0.34 | 5 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dillon Mayhew | 1 | 102 | 18.63 |
| Geoff Whittle | 2 | 471 | 57.57 |
| Stefan H. M. van Zwam | 3 | 60 | 8.60 |