Cubic maximal nontraceable graphs (Q868358): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
Property / arXiv ID | |||
Property / arXiv ID: math/0407290 / rank | |||
Normal rank |
Revision as of 18:17, 18 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Cubic maximal nontraceable graphs |
scientific article |
Statements
Cubic maximal nontraceable graphs (English)
0 references
2 March 2007
0 references
The authors determine a lower bound for the number of edges of a 2-connected maximal nontraceable graph and present a construction of an infinite family of maximal nontraceable graphs that realizes this bound. The construction proposed by the authors yields maximal nontraceable graphs of girth 5, 6 and 7. The problem of the existence of maximal nontraceable graphs of girth bigger than 7 remains open.
0 references
maximal nonhamiltonian
0 references
Hamiltonian path
0 references
Hamiltonian cycle
0 references