An implicit degree condition for Hamiltonian graphs

DOI10.1016/j.disc.2012.03.001zbMath1244.05137OpenAlexW2028969401MaRDI QIDQ432725

Wantao Ning, Hao Li, Jun-qing Cai

Publication date: 4 July 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2012.03.001

zbMATH Keywords

independent setHamiltonian cycledegree sumimplicit degree

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Related Items (5)

Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey ⋮ An implicit degree condition for \(k\)-connected 2-heavy graphs to be Hamiltonian ⋮ Implicit degree condition for Hamiltonicity of 2-heavy graphs ⋮ A generalization of implicit Ore-condition for Hamiltonicity of \(k\)-connected graphs ⋮ Downhill domination problem in graphs

Cites Work

• Unnamed Item
• Implicit-degrees and circumferences
• Note on Hamilton Circuits
• Some Theorems on Abstract Graphs

This page was built for publication: An implicit degree condition for Hamiltonian graphs