Abstract | ||
---|---|---|
Given a fixed graph H, we provide a sharp degree-sum condition such that if a graph G is sufficiently large with sufficiently large minimum degree sum, then it contains a spanning H-subdivision in which the ground vertices and lengths of the corresponding edge paths are specified. |
Year | DOI | Venue |
---|---|---|
2019 | 10.1016/j.dam.2018.09.008 | Discrete Applied Mathematics |
Keywords | Field | DocType |
Degree sum,Subdivision,Linkage | Graph,Discrete mathematics,Combinatorics,Vertex (geometry),Subdivision,Mathematics | Journal |
Volume | ISSN | Citations |
257 | 0166-218X | 0 |
PageRank | References | Authors |
0.34 | 5 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Vincent Coll | 1 | 2 | 2.51 |
Colton Magnant | 2 | 113 | 29.08 |
Pouria Salehi Nowbandegani | 3 | 5 | 4.30 |