Some localization theorems on Hamiltonian circuits

DOI10.1016/0095-8956(90)90032-UzbMath0708.05038OpenAlexW2054515874MaRDI QIDQ920111

N. K. Khachatrian, Armen S. Asratian

Publication date: 1990

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(90)90032-u

Mathematics Subject Classification ID

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

Related Items

Vertex pancyclic graphs ⋮ A sufficient local degree condition for Hamiltonicity in locally finite claw-free graphs ⋮ Subgraphs, closures and hamiltonicity ⋮ On Hamiltonicity of regular graphs with bounded second neighborhoods ⋮ Claw-free graphs---a survey ⋮ Cycles through all finite vertex sets in infinite graphs ⋮ Some local-global phenomena in locally finite graphs ⋮ On Saito's conjecture and the Oberly-Sumner conjectures ⋮ Some panconnected and pancyclic properties of graphs with a local Ore-type condition ⋮ Extensions and consequences of Chvátal-Erdös' theorem ⋮ Local Dirac's condition on the existence of 2-factor ⋮ Local connectivity, local degree conditions, some forbidden induced subgraphs, and cycle extendability ⋮ A localization method in Hamiltonian graph theory ⋮ Unnamed Item ⋮ Locally finite graphs with ends: A topological approach. II: Applications ⋮ New local conditions for a graph to be Hamiltonian ⋮ Global cycle properties in graphs with large minimum clustering coefficient ⋮ A note on \(K_ 4\)-closures in hamiltonian graph theory

Cites Work

• Unnamed Item
• Unnamed Item
• Two theorems on Hamiltonian graphs
• New sufficient conditions for cycles in graphs
• A method in graph theory
• Note on Hamilton Circuits
• Some Theorems on Abstract Graphs