An efficient condition for a graph to be Hamiltonian
From MaRDI portal
Publication:2383542
DOI10.1016/j.dam.2007.03.013zbMath1123.05060MaRDI QIDQ2383542
Rui Juan Li, Jinfeng Feng, Sheng-Jia Li
Publication date: 19 September 2007
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2007.03.013
05C45: Eulerian and Hamiltonian graphs
Related Items
Fan type condition and characterization of Hamiltonian graphs, Hamiltonian cycles and 2-dominating induced cycles in claw-free graphs, Degree sum condition on distance 2 vertices for Hamiltonian cycles in balanced bipartite graphs, A sufficient condition for vertex bipancyclicity in balanced bipartite graphs, On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem, Degree conditions on distance 2 vertices that imply \(k\)-ordered Hamiltonian, A sufficient condition for pancyclic graphs, A comprehensive analysis of degree based condition for Hamiltonian cycles, On one extension of Dirac's theorem on Hamiltonicity, The H-force sets of the graphs satisfying the condition of Ore's theorem, Hamiltonian paths, unit-interval complexes, and determinantal facet ideals, Disjoint cycles in hypercubes with prescribed vertices in each cycle
Cites Work