Toward Pancyclicity in 4‐Connected Planar Graphs
ABSTRACT We show that every edge in a 4‐connected planar graph on vertices is contained in at least cycles of pairwise distinct lengths. We also show that this number can be at best. In the case of 4‐connected planar graphs not containing a 4‐cycle, we show that any such graph on vertices contains at least cycles of pairwise distinct lengths.
Authors
- Bojan Mohar (ORCID: https://orcid.org/0000-0002-7408-6148)
- Abhinav Shantanam
Institutions
- Université Libre de Bruxelles (BE)
- Simon Fraser University (CA)
Publication Details
- Journal
- Journal of Graph Theory
- Published
- 2026-11-03
- DOI
- https://doi.org/10.1002/jgt.70152
- Primary Topic
- Advanced Graph Theory Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00