Improved degree conditions for Hamiltonian properties

DOI10.1016/j.disc.2011.07.013zbMath1244.05136OpenAlexW1970185482MaRDI QIDQ432715

Arnfried Kemnitz, Ingo Schiermeyer

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.2011.07.013

zbMATH Keywords

HamiltoniantraceableHamiltonian-connectedbondy's theoremdegree sum conditions

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Related Items (8)

Dense on-line arbitrarily partitionable graphs ⋮ Extremal graphs for the distinguishing index ⋮ The proper 2-connection number and size of graphs ⋮ On the 1-fault hamiltonicity for graphs satisfying Ore's theorem and its generalization ⋮ Hamiltonian Cycle in K1,r-Free Split Graphs — A Dichotomy ⋮ Dense arbitrarily partitionable graphs ⋮ Hamiltonicity in Split Graphs - A Dichotomy ⋮ Conflict-free connection number and size of graphs

Cites Work

• Hamilton connected graphs
• A method in graph theory
• A note on Hamiltonian circuits
• Note on Hamilton Circuits
• A new sufficient condition for hamiltonian graphs
• Some Theorems on Abstract Graphs
• Unnamed Item

This page was built for publication: Improved degree conditions for Hamiltonian properties