Hamiltonian circuits in N2‐locally connected K1,3‐free graphs

DOI10.1002/jgt.3190140305zbMath0718.05036OpenAlexW2403919842MaRDI QIDQ5749315

Zdeněk Ryjáček

Publication date: 1990

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190140305

zbMATH Keywords

Hamiltonian graphHamiltonian cycleneighbourhood

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items

On Hamiltonicity of regular graphs with bounded second neighborhoods ⋮ Claw-free graphs---a survey ⋮ Unnamed Item ⋮ On a closure concept in claw-free graphs ⋮ Quadrangularly connected claw-free graphs ⋮ A note on singular edges and Hamiltonicity in claw-free graphs with locally disconnected vertices ⋮ 2-Factors in claw-free graphs with locally disconnected vertices ⋮ Vertex pancyclicity of quadrangularly connected claw-free graphs ⋮ Hamiltonian properties of locally connected graphs with bounded vertex degree ⋮ On Hamiltonicity of 3-connected claw-free graphs ⋮ EVERY N₂-LOCALLY CONNECTED CLAW-FREE GRAPH WITH MINIMUM DEGREE AT LEAST 7 IS Z₃-CONNECTED ⋮ Vertex pancyclism in claw-free graphs ⋮ \(N_ 2\)-locally disconnected graphs ⋮ Hamiltonian claw-free graphs with locally disconnected vertices