About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Journal of Graph Theory
Paper
Minimum k‐hamiltonian graphs, II
Abstract
We consider in this paper graphs which remain hamiltonian after the removal of k edges (k‐edge hamiltonian) or k vertices (k‐hamiltonian). These classes of graphs arise from reliability considerations in network design. In a previous paper, W. W. Wong and C. K. Wong presented families of minimum k‐hamiltonian graphs and minimum k‐edge hamiltonian graphs for k even. Here, we complete this study in the case where k is odd. Copyright © 1986 Wiley Periodicals, Inc., A Wiley Company