Back to Search
Start Over
Hamiltonian Extendable Graphs
- Source :
- Discussiones Mathematicae Graph Theory, Vol 42, Iss 3, Pp 843-859 (2022)
- Publication Year :
- 2022
- Publisher :
- University of Zielona Góra, 2022.
-
Abstract
- A graph is called Hamiltonian extendable if there exists a Hamiltonian path between any two nonadjacent vertices. In this paper, we give an explicit formula of the minimum number of edges for Hamiltonian extendable graphs and we also characterize the degree sequence for Hamiltonian extendable graphs with minimum number of edges. Besides, we completely characterize the pairs of forbidden subgraphs for 2-connected graphs to be Hamiltonian extendable.
- Subjects :
- hamiltonian extendable
forbidden subgraph
05c38
05c45
Mathematics
QA1-939
Subjects
Details
- Language :
- English
- ISSN :
- 20835892
- Volume :
- 42
- Issue :
- 3
- Database :
- Directory of Open Access Journals
- Journal :
- Discussiones Mathematicae Graph Theory
- Publication Type :
- Academic Journal
- Accession number :
- edsdoj.0166a2701a084b38baad6f4a40d52539
- Document Type :
- article
- Full Text :
- https://doi.org/10.7151/dmgt.2308