Name
Abstract | ||
|---|---|---|
We prove that every 2-connected outerplanar graph of order at least k (k=3) contains a path on k vertices with all vertices of degree at most k+3 and a path on k vertices with degree sum at most 4k-2. Further, every 2-connected outerplanar graph without adjacent vertices with degree sum = |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1016/j.disc.2005.11.058 | Discrete Mathematics |
Keywords | Field | DocType |
path,light graph,triangle,3-star,outerplanar graph | Graph center,Discrete mathematics,Wheel graph,Combinatorics,k-vertex-connected graph,Induced path,Distance,Cycle graph,Neighbourhood (graph theory),Mathematics,Path graph | Journal |
Volume | Issue | ISSN |
307 | 7-8 | Discrete Mathematics |
Citations | PageRank | References |
3 | 0.43 | 7 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Igor Fabrici | 1 | 101 | 14.64 |