Hamiltonian-connected graphs

DOI10.1016/J.CAMWA.2007.10.018zbMath1142.05332OpenAlexW2128957433MaRDI QIDQ945175

Zhao Kewen, Hong-Jian Lai, Ju Zhou

Publication date: 11 September 2008

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2007.10.018

zbMATH Keywords

Hamiltonian pathneighborhood unionHamiltonian graphsHamiltonian-connected graphsdegree condition

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (7)

Two types of path structures of graphs ⋮ Hamilton-connectivity of line graphs with application to their detour index ⋮ Hamilton-connectedness and Hamilton-laceability of planar geometric graphs with applications ⋮ On the 1-fault hamiltonicity for graphs satisfying Ore's theorem and its generalization ⋮ Degree with neighborhood conditions and highly Hamiltonian graphs ⋮ Paired many-to-many disjoint path covers of hypertori ⋮ 1-(edge-)trail-connected square tree

Cites Work

• Unnamed Item
• Unnamed Item
• Hamilton connected graphs
• Neighbourhood unions and Hamiltonian properties in graphs
• Hamiltonian paths and hamiltonian connectivity in graphs
• Note on Hamilton Circuits
• Some Theorems on Abstract Graphs

This page was built for publication: Hamiltonian-connected graphs