Abstract
In this paper, we show that all simple outerplanar graphs G with minimum degree at least 2 and positive Lin–Lu–Yau Ricci curvature on every edge have maximum degree at most 9. Furthermore, if G is maximally outerplanar, then G has at most 10 vertices. Both upper bounds are sharp.
| Original language | English |
|---|---|
| Pages (from-to) | 465-480 |
| Number of pages | 16 |
| Journal | Journal of Combinatorics |
| Volume | 16 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 22 Sept 2025 |
Bibliographical note
Publisher Copyright:© 2025, International Press, Inc.. All rights reserved.
Keywords
- maximum degree
- outerplanar graphs
- Positive Lin–Lu–Yau curvature
Fingerprint
Dive into the research topics of 'Outerplanar graphs with positive Lin–Lu–Yau curvature'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver