Neighborhood unions and hamiltonicity of graphs (Q1894772): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5422499 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A generalization of Ore's Theorem involving neighborhood unions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Neighbourhood unions and Hamiltonian properties in graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Neighborhood unions and hamilton cycles / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The effects of distance and neighborhood union conditions on hamiltonian properties in graphs / rank | |||
Normal rank | |||
Revision as of 14:54, 23 May 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
