Elsevier

Discrete Mathematics

Volume 196, Issues 1–3, 6 February 1999, Pages 167-175
Discrete Mathematics

Contributions
A generalization of fan's condition and forbidden subgraph conditions for hamiltonicity

https://doi.org/10.1016/S0012-365X(98)00200-3Get rights and content
Under an Elsevier user license
open archive

Abstract

Let G be a 2-connected graph with n vertices and H be an induced subgraph of G. Denote V0 ≔ {v ϵ V(G): d(v) ⩾ n/2}. If there exists a pair of vertices x and y at distance 2 in H such that {x, y} ⊆ V(H)βV0, then H is called degree light. Let F be the unique graph with degree sequence (1, 1, 1, 3, 3, 3). In this paper, we prove that if G contains no degree light K1, 3 and every degree light F of G contains no induced P4 of GV0, then G is hamiltonian.

Cited by (0)