Some hamiltonian properties of \(L_1\)-graphs (Q1587606): Difference between revisions

A graph \(G\) is called an \(L_1\)-graph if \(d(u)+d(v)\geq|N(u)\cup N(v)\cup N(w)|-1\) for each triple of vertices \(u\), \(v\), and \(w\) with \(d(u,v)=2\) and \(w\in N(u)\cap N(v)\). It can easily be verified that every claw-free graph is an \(L_1\)-graph. The primary objective of this paper is to show that two results of \textit{M. M. Matthews} and \textit{D. P. Sumner} [J. Graph Theory 9, 269-277 (1985; Zbl 0591.05041)] on claw-free graphs hold for the larger family of \(L_1\)-graphs. For example, the authors extend the following theorem of Matthews and Sumner: If \(G\) is a 2-connected claw-free graph of order \(n\) with \(\delta(G)\geq(n-2)/3\), then \(G\) is hamiltonian.