Abstract
Abstract Let c ( n ) be the maximum number of cycles in an outerplanar graph with n vertices. We show that lim c ( n ) 1 / n exists and equals β = 1.502837 … , where β is a constant related to the recurrence x n + 1 = 1 + x n 2 , x 0 = 1 . The same result holds for the larger class of series-parallel graphs.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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 call
