Hamiltonian path saturated graphs with small size (Q2492212)
From MaRDI portal
!
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 5030501
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hamiltonian path saturated graphs with small size |
scientific article; zbMATH DE number 5030501 |
Statements
Hamiltonian path saturated graphs with small size (English)
0 references
9 June 2006
0 references
A graph \(G\) is Hamiltonian path saturated if \(G\) has no Hamiltonian path and any addition of a new edge in \(G\) creates a Hamiltonian path in \(G\). The authors establish a lower bound for the minimum size of a Hamiltonian path saturated graph for a given order. Small size path-cover saturated graphs are also considered.
0 references
path-cover
0 references
extremal graph
0 references
0 references
0.9086947
0 references
0.9083042
0 references
0 references
0.88888395
0 references
0.8865216
0 references
0.88433456
0 references
0 references
0.88065815
0 references
