Neighborhood unions and hamiltonicity of graphs (Q1894772): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0012-365x(93)00181-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1964197500 / rank | |||
Normal rank | |||
Latest revision as of 11:00, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Neighborhood unions and hamiltonicity of graphs |
scientific article |
Statements
Neighborhood unions and hamiltonicity of graphs (English)
0 references
24 July 1995
0 references
If \(G\) is a 2-connected graph of order \(n\) such that the union of the neighborhoods of each pair of vertices that are a distance 2 apart is at least \((n+ 2)/3\), then \(G\) is either hamiltonian or belongs to one of three exceptional classes of graphs (all of which are 2-connected). This generalizes a result of \textit{B. Jackson} [J. Graph Theory 15, No. 4, 443- 451 (1991; Zbl 0739.05058)] in which the same neighborhood condition was used for all nonadjacent pairs of vertices.
0 references
hamiltonicity
0 references
2-connected graph
0 references
hamiltonian
0 references
neighborhood condition
0 references
