Cycles through subsets with large degree sums

Haitze J. Broersma, Hao Li, Jianping Li, Feng Tian, H.J. Veldman

Research output: Contribution to journalArticleAcademicpeer-review

28 Citations (Scopus)
101 Downloads (Pure)

Abstract

Let G be a 2-connected graph on n vertices and let X V(G). We say that G is X-cyclable if G has an X-cycle, i.e., a cycle containing all vertices of X. We denote by ¿(X) the maximum number of pairwise nonadjacent vertices in the subgraph G[X] of G induced by X. If G[X] is not complete, we denote by ¿(X) the minimum cardinality of a set of vertices of G separating two vertices of X. By ¿(X) we denote the minimum degree (in G) of the vertices of X, and by ¿3(X) the minimum value of the degree sum (in G) of any three pairwise nonadjacent vertices of X. Our first main result is the following extension in terms of X-cyclability of a result on hamiltonian graphs by Bauer et al. If ¿3(X) n + mingk(X), ¿(X), then G is X-cyclable. Our second main result is the following generalization of a result of Fournier. If ¿(X) ¿(X), then G is X-cyclable. We give a number of extensions of other known results, thereby generalizing some recent results of Veldman.
Original languageEnglish
Pages (from-to)43-54
Number of pages12
JournalDiscrete mathematics
Volume171
DOIs
Publication statusPublished - 1997

Fingerprint Dive into the research topics of 'Cycles through subsets with large degree sums'. Together they form a unique fingerprint.

Cite this