Minimal \(2\)-connected non-Hamiltonian claw-free graphs
From MaRDI portal
Publication:1584413
DOI10.1016/S0012-365X(98)00093-4zbMath0958.05086OpenAlexW1995322874MaRDI QIDQ1584413
Publication date: 2 November 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00093-4
Related Items (18)
Heavy subgraphs, stability and Hamiltonicity ⋮ Solution to a problem on Hamiltonicity of graphs under Ore- and Fan-type heavy subgraph conditions ⋮ Minimal induced subgraphs of two classes of 2-connected non-Hamiltonian graphs ⋮ Induced subgraphs with large degrees at end-vertices for Hamiltonicity of claw-free graphs ⋮ Extremal problems on the Hamiltonicity of claw-free graphs ⋮ A characterization of 2-connected \(\{ K_{1 , 3} , N_{3 , 1 , 1} \}\)-free non-Hamiltonian graphs ⋮ Forbidden set of induced subgraphs for 2-connected supereulerian graphs ⋮ Forbidden pairs of disconnected graphs for supereulerianity of connected graphs ⋮ Forbidden Pairs of Disconnected Graphs Implying Hamiltonicity ⋮ Minimal \(k\)-connected non-Hamiltonian graphs ⋮ Forbidden pairs for spanning (closed) trails ⋮ Forbidden subgraphs for graphs with (near) perfect matching to be hamiltonian ⋮ Degree conditions restricted to induced paths for Hamiltonicity of claw-heavy graphs ⋮ Forbidden subgraphs that imply 2-factors ⋮ Induced nets and Hamiltonicity of claw-free graphs ⋮ Forbidden subgraphs, stability and hamiltonicity ⋮ Forbidden subgraphs, hamiltonicity and closure in claw-free graphs ⋮ Minimal induced subgraphs of the class of 2-connected non-Hamiltonian wheel-free graphs
Cites Work
This page was built for publication: Minimal \(2\)-connected non-Hamiltonian claw-free graphs
