On sufficient conditions for Hamiltonicity of graphs, and beyond
From MaRDI portal
Recommendations
- Sufficient conditions for Hamiltonian properties of graphs based on the difference of Zagreb indices
- On hyper-Zagreb index conditions for hamiltonicity of graphs
- scientific article; zbMATH DE number 7090173
- First Zagreb index, \(k\)-connectivity, \( \beta \)-deficiency and \(k\)-Hamiltonicity of graphs
- Sufficient conditions for a graph to be k-edge-Hamiltonian, k-path-coverable, traceable and Hamilton-connected
Cites work
- A method in graph theory
- A note on K-path hamiltonian graphs
- Best monotone degree conditions for graph properties: a survey
- Computation on the difference of Zagreb indices of maximal planar graphs with diameter two
- Hamiltonian \(s\)-properties and eigenvalues of \(k\)-connected graphs
- scientific article; zbMATH DE number 3485819 (Why is no real title available?)
- scientific article; zbMATH DE number 6282153 (Why is no real title available?)
- scientific article; zbMATH DE number 3293646 (Why is no real title available?)
- On difference of Zagreb indices
- On Hamilton's ideals
- On hyper-Zagreb index conditions for hamiltonicity of graphs
- On n-Hamiltonian graphs
- On sufficient topological indices conditions for properties of graphs
- On the s-hamiltonianicity of an hourglass-free line graph
- On the extremal cacti of given parameters with respect to the difference of Zagreb indices
- Sufficient conditions for certain structural properties of graphs based on Wiener-type indices
Cited in
(8)- On hyper-Zagreb index conditions for hamiltonicity of graphs
- Some sufficient conditions for graphs to be k-leaf-connected
- Some results on vulnerability parameters and Wiener-type indices
- Sufficient conditions for Hamiltonian properties of graphs based on the difference of Zagreb indices
- Sufficient conditions for some graphical properties in terms of the Lanzhou index and the ad-hoc Lanzhou index
- On regular 2-path Hamiltonian graphs
- Results on k-leaf-connected graphs and digraphs: a survey
- Hamiltonicity in the chained cubic tree interconnection network CCT(h, n)
This page was built for publication: On sufficient conditions for Hamiltonicity of graphs, and beyond
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6197644)