Cubic maximal nontraceable graphs (Q868358)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 5130447
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cubic maximal nontraceable graphs |
scientific article; zbMATH DE number 5130447 |
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
0 references
0.9038463
0 references
0 references
0.89242893
0 references
0 references
0.8890226
0 references
0.8883826
0 references
0 references
0 references
