Title
Note on Semi-Linkage with Almost Prescribed Lengths in Large Graphs.
Abstract
We prove a sharp connectivity and degree sum condition for the existence of a subdivision of a multigraph in which some of the vertices are specified and the distance between each pair of vertices in the subdivision is prescribed (within one). Our proof makes use of the powerful Regularity Lemma in an easy way that highlights the extreme versatility of the lemma.
Year
DOI
Venue
2016
10.1007/s00373-015-1631-5
Graphs and Combinatorics
Keywords
Field
DocType
Graph linkage, Distance, 05C35, 05C12
Topology,Discrete mathematics,Graph,Combinatorics,Multigraph,Vertex (geometry),Subdivision,Mathematics,Lemma (mathematics)
Journal
Volume
Issue
ISSN
32
3
1435-5914
Citations 
PageRank 
References 
1
0.40
8
Authors
3
Name
Order
Citations
PageRank
Emily Chizmar110.40
Colton Magnant211329.08
Pouria Salehi Nowbandegani354.30