A sufficient condition for graphs with large neighborhood unions to be traceable (Q1356426): 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(95)00230-t / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1983760777 / rank | |||
Normal rank | |||
Latest revision as of 10:22, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A sufficient condition for graphs with large neighborhood unions to be traceable |
scientific article |
Statements
A sufficient condition for graphs with large neighborhood unions to be traceable (English)
0 references
31 August 1997
0 references
Hamilton path
0 references
neighborhood unions
0 references
traceable
0 references
Lindquester's conjecture
0 references
