Advances and Applications in Discrete Mathematics
Volume 1, Issue 1, Pages 71 - 90
(January 2008)
|
|
LONGEST CYCLES OF A 3-CONNECTED GRAPH WHICH CONTAIN FIVE CONTRACTIBLE EDGES
Kyo Fujita (Japan)
|
Abstract: We classify all pairs of a
3-connected graph G of order at least 16 or of even order and a longest
cycle C of G such that C contains precisely five
contractible edges of G. |
Keywords and phrases: 3-connected graph, contractible edge, hamiltonian cycle. |
|
Number of Downloads: 240 | Number of Views: 713 |
|