n-Hamiltonian graphs

DOI10.1016/S0021-9800(70)80069-2MaRDI QIDQ5604410zbMATH OpenOpenAlexFDO

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

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

Cited in

(19)

• Stable properties of graphs
• On n-Hamiltonian graphs
• A method in graph theory
• The square of a block is Hamiltonian connected
• Wiener index, Harary index and graph properties
• The first Zagreb index, reciprocal degree distance and Hamiltonian-connectedness of graphs
• Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable
• On Hamilton's ideals
• Graphs with 1-hamiltonian-connected cubes
• Sufficient conditions for a graph to be k-edge-Hamiltonian, k-path-coverable, traceable and Hamilton-connected
• On critically hamiltonian graphs
• On pancyclic line graphs
• Improved bounds for hypo-Hamiltonian graphs
• Enforced Hamiltonian cycles in circulant graphs
• 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
• Several graph properties in terms of the multiplicative version of the first Zagreb index
• Network fault costs based on minimum leaf spanning trees

This page was built for publication: n-Hamiltonian graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5604410)