Name
Abstract | ||
|---|---|---|
For an integer c=2 and k=2,3, guaranteed upper bounds on the length of a shortest path through k prescribed vertices of a c-connected graph or a c-connected planar graph are proved. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1016/j.disc.2005.11.040 | Discrete Mathematics |
Keywords | Field | DocType |
05c38,prescribed vertices,short path,cycle,graph,connected graph,shortest path,upper bound,planar graph | Wheel graph,Discrete mathematics,Combinatorics,k-vertex-connected graph,Graph power,Cycle graph,Distance,Distance-regular graph,Mathematics,Complement graph,Path graph | Journal |
Volume | Issue | ISSN |
307 | 7-8 | Discrete Mathematics |
Citations | PageRank | References |
2 | 0.37 | 6 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Erhard Hexel | 1 | 24 | 4.54 |