n-Hamiltonian graphs

DOI10.1016/S0021-9800(70)80069-2zbMath0204.57005OpenAlexW2015610157MaRDI QIDQ5604410

Gary Chartrand, Don R. Lick, S. F. Kapoor

Publication date: 1970

Published in: Journal of Combinatorial Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0021-9800(70)80069-2

Related Items (17)

The first Zagreb index, reciprocal degree distance and Hamiltonian-connectedness of graphs ⋮ Unnamed Item ⋮ The square of a block is Hamiltonian connected ⋮ Some sufficient conditions for graphs being \(k\)-leaf-connected ⋮ Minimum degree ensuring that a hypergraph is Hamiltonian-connected ⋮ Sufficient spectral conditions for graphs being k-edge-Hamiltonian or k-Hamiltonian ⋮ On pancyclic line graphs ⋮ Improved bounds for hypohamiltonian graphs ⋮ Stable properties of graphs ⋮ On n-Hamiltonian graphs ⋮ A method in graph theory ⋮ On critically hamiltonian graphs ⋮ Wiener index, Harary index and graph properties ⋮ Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable ⋮ Unnamed Item ⋮ On Hamilton's ideals ⋮ Graphs with 1-hamiltonian-connected cubes

This page was built for publication: n-Hamiltonian graphs