Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
