Opuscula Mathematica (Mar 2025)

Local properties of graphs that induce global cycle properties

  • Yanyan Wang,
  • Xiaojing Yang

DOI
https://doi.org/10.7494/opmath.2025.45.2.275
Journal volume & issue
Vol. 45, no. 2
pp. 275 – 285

Abstract

Read online

A graph \(G\) is locally Hamiltonian if \(G[N(v)]\) is Hamiltonian for every vertex \(v\in V(G)\). In this note, we prove that every locally Hamiltonian graph with maximum degree at least \(|V(G)| - 7\) is weakly pancyclic. Moreover, we show that any connected graph \(G\) with \(\Delta(G)\leq 7\) and \(\delta(G[N(v)])\geq 3\) for every \(v\in V (G)\), is fully cycle extendable. These findings improve some known results by Tang and Vumar.

Keywords