A sufficient condition for graphs with large neighborhood unions to be traceable (Q1356426): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3818315 / 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 13:09, 27 May 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
