A sufficient condition for graphs with large neighborhood unions to be traceable (Q1356426)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A sufficient condition for graphs with large neighborhood unions to be traceable |
scientific article; zbMATH DE number 1018487
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A sufficient condition for graphs with large neighborhood unions to be traceable |
scientific article; zbMATH DE number 1018487 |
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
