Abstract
We classify all pairs of a -connected graph and a longest cycle of such that contains precisely four contractible edges of .
Acknowledgment
I would like to thank Professor Yoshimi Egawa for the help he gave to me during the preparation of this paper.
Citation
Kyo Fujita. "Longest Cycles of a -Connected Graph Which Contain Four Contractible Edges." SUT J. Math. 43 (2) 287 - 303, June 2007. https://doi.org/10.55937/sut/1205868627
Information