Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
From MaRDI portal
Publication:3858300
DOI10.1002/jgt.3190030405zbMath0424.05036OpenAlexW1909115871MaRDI QIDQ3858300
David J. Oberly, David P. Sumner
Publication date: 1979
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190030405
Related Items (56)
Global cycle properties of locally isometric graphs ⋮ Global cycle properties in locally connected, locally traceable and locally Hamiltonian graphs ⋮ Extending cycles locally to Hamilton cycles ⋮ Hamilton cycles in implicit 2-heavy graphs ⋮ On Hamiltonicity of regular graphs with bounded second neighborhoods ⋮ Chvátal–Erdős Theorem: Old Theorem with New Aspects ⋮ Dirac's minimum degree condition restricted to claws ⋮ Claw-free graphs---a survey ⋮ On pancyclic line graphs ⋮ Unnamed Item ⋮ On a closure concept in claw-free graphs ⋮ Nested locally Hamiltonian graphs and the Oberly-Sumner conjecture ⋮ On the cycle spectrum of cubic Hamiltonian graphs ⋮ Quadrangularly connected claw-free graphs ⋮ Some local-global phenomena in locally finite graphs ⋮ Quasi-claw-free graphs ⋮ Dominating sets and Hamiltonicity in \(K_{1,3}\)-free graphs ⋮ A note on singular edges and Hamiltonicity in claw-free graphs with locally disconnected vertices ⋮ Vertex pancyclicity in quasi claw-free graphs ⋮ On Saito's conjecture and the Oberly-Sumner conjectures ⋮ A note on locally connected and Hamiltonian-connected graphs ⋮ 2-Factors in claw-free graphs with locally disconnected vertices ⋮ On Hamilton Cycles in Locally Connected Graphs with Vertex Degree Constraints ⋮ Vertex pancyclicity of quadrangularly connected claw-free graphs ⋮ Hamiltonicity of locally Hamiltonian and locally traceable graphs ⋮ Exact algorithms for finding longest cycles in claw-free graphs ⋮ Endpoint extendable paths in dense graphs ⋮ Hamiltonian properties of locally connected graphs with bounded vertex degree ⋮ Forbidden subgraphs and Hamiltonian properties and graphs ⋮ A sufficient condition for Hamiltonicity in locally finite graphs ⋮ Hamiltonicity in claw-free graphs ⋮ Local connectivity, local degree conditions, some forbidden induced subgraphs, and cycle extendability ⋮ Forbidden subgraphs and weak locally connected graphs ⋮ A localization method in Hamiltonian graph theory ⋮ The edge-closure concept for claw-free graphs and the stability of forbidden subgraphs ⋮ Locally finite graphs with ends: A topological approach. II: Applications ⋮ Extremal infinite graph theory ⋮ Path extendability of claw-free graphs ⋮ The Hamilton cycle problem for locally traceable and locally Hamiltonian graphs ⋮ A note on cycles in locally Hamiltonian and locally Hamilton-connected graphs ⋮ Deficiency and forbidden subgraphs of connected, locally-connected graphs ⋮ The Ryjáček closure and a forbidden subgraph ⋮ Hamiltonian properties of triangular grid graphs ⋮ On Hamiltonicity of 3-connected claw-free graphs ⋮ Vertex pancyclicity in quasi-claw-free graphs ⋮ Cycles of given length in some \(K_{1,3}\)-free graphs ⋮ Extending cycles in graphs ⋮ Global cycle properties in graphs with large minimum clustering coefficient ⋮ On distance local connectivity and the Hamiltonian index ⋮ Closure concepts for claw-free graphs ⋮ Vertex pancyclism in claw-free graphs ⋮ On connected factors in \(K_{1,3}\)-free graphs ⋮ Panconnectivity of locally connected claw-free graphs ⋮ Hamiltonian claw-free graphs with locally disconnected vertices ⋮ The distance matching extension in \(K_{1,k}\)-free graphs with high local connectedness ⋮ Extending matchings in claw-free graphs
Cites Work
This page was built for publication: Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
