Hamiltonian extendable graphs (Q2151217)
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: Hamiltonian extendable graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hamiltonian extendable graphs |
scientific article |
Statements
Hamiltonian extendable graphs (English)
0 references
1 July 2022
0 references
A graph is Hamiltonian extendable if each pair of nonadjacent vertices can be extended to a Hamiltonian cycle. The authors establish the minimum number of edges for Hamiltonian extendable graphs, characterize the degree sequence for Hamiltonian extendable graphs with a minimum number of edges, and characterize the pairs of forbidden subgraphs for 2-connected graphs to be Hamiltonian extendable.
0 references
Hamiltonian extendable
0 references
forbidden subgraph
0 references
