Longest cycles in 3-connected planar graphs

Bill Jackson, Nicholas C. Wormald

Research output: Contribution to journalArticleResearchpeer-review

10 Citations (Scopus)


We give lower bounds on the length of a longest cycle in a planar graph on n vertices which is 3-connected or cyclically 4-connected.

Original languageEnglish
Pages (from-to)291-321
Number of pages31
JournalJournal of Combinatorial Theory, Series B
Issue number2
Publication statusPublished - 1992
Externally publishedYes

Cite this