#### Filter Results:

#### Publication Year

1995

1997

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

We consider the maximum sum of the degrees of vertices with degree at least k in any simple planar graph on n vertices. West and Will solved this for k 12 and n m k and gave bounds for 6 k 11. Here we complete the solution by constructing graphs achieving the bounds for all n m k when k 11.

- ‹
- 1
- ›