Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference12 articles.
1. Aldred, R.E.L., Hemminger, R.L., Ota, K.: The 3-connected graphs having a longest cycle containing only three contractible edges. J. Graph Theory 17, 361–371 (1993)
2. Dean, N., Hemminger, R.L., Ota, K.: Longest cycles in 3-connected graphs contain three contractible edges. J. Graph Theory 12, 17–21 (1989)
3. Diestel, R.: “Graph Theory’’ graduate texts in mathematics, 5th edn., p. 173. Springer, Berlin (2017)
4. Ellingham, M.N., Hemminger, R.L., Johnson, K.E.: Contractible edges in longest cycles in nonhamiltonian graphs. Discrete Math. 133, 89–98 (1994)
5. Fujita, K.: Longest cycles $$C$$ in a 3-connected graph $$G$$ such that $$C$$ contains precisely four contractible edges of $$G$$. Math. Japon. 43, 99–116 (1996)