Some hamiltonian properties of \(L_1\)-graphs (Q1587606): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0012-365x(00)00046-7 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1976502630 / rank | |||
Normal rank |
Latest revision as of 10:25, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Some hamiltonian properties of \(L_1\)-graphs |
scientific article |
Statements
Some hamiltonian properties of \(L_1\)-graphs (English)
0 references
10 May 2001
0 references
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.
0 references
hamiltonicity
0 references
\(L_1\)-graphs
0 references