A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf
.
On some super fault-tolerant Hamiltonian graphs
2004
Applied Mathematics and Computation
A k-regular Hamiltonian and Hamiltonian connected graph G is super fault-tolerant Hamiltonian if G remains Hamiltonian after removing at most k À 2 nodes and/or edges and remains Hamiltonian connected after removing at most k À 3 nodes and/or edges. A super fault-tolerant Hamiltonian graph has a certain optimal flavor with respect to the fault-tolerant Hamiltonicity and Hamiltonian connectivity. In this paper, we investigate a construction scheme to construct super fault-tolerant Hamiltonian
doi:10.1016/s0096-3003(02)00933-5
fatcat:yyjcdvvrbbctfohdntgrron4ay