Hamiltonian path saturated graphs with small size (Q2492212): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2005.05.035 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2006892215 / rank | |||
Normal rank | |||
Revision as of 21:50, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hamiltonian path saturated graphs with small size |
scientific article |
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
