Tight Gaps in the Cycle Spectrum of 3-Connected Planar Graphs
2021
For any positive integer $k$, define $f(k)$ (respectively, $f_3(k)$) to be the minimal integer $\ge k$ such that every 3-connected planar graph $G$ (respectively, 3-connected cubic planar graph $G$...
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
1
References
0
Citations
NaN
KQI