Minimal 2-connected non-Hamiltonian claw-free graphs
From MaRDI portal
Recommendations
- On Hamiltonicity of 2-connected claw-free graphs
- Hamiltonicity in \(2\)-connected claw-free graphs
- Hamiltonicity of 2-connected quasi-claw-free graphs
- Hamiltonian claw-free graphs involving minimum degrees
- Hamiltonian connected claw-free graphs
- Hamiltonian connectedness in claw-free graphs
- Hamiltonian connectedness in claw-free graphs
- Hamiltonian cycles in \(2\)-connected claw-free graphs
- HamiltonianN2-locally connected claw-free graphs
- Hamilton‐connected {claw,net}‐free graphs, II
Cites work
- scientific article; zbMATH DE number 4191710 (Why is no real title available?)
- scientific article; zbMATH DE number 3730183 (Why is no real title available?)
- scientific article; zbMATH DE number 842880 (Why is no real title available?)
- scientific article; zbMATH DE number 1409241 (Why is no real title available?)
- A strengthening of Ben Rebea's lemma
- Graph theory
Cited in
(22)- Forbidden subgraphs for graphs with (near) perfect matching to be Hamiltonian
- Forbidden pairs of disconnected graphs implying Hamiltonicity
- Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
- Minimal claw-free graphs
- Forbidden subgraphs, stability and hamiltonicity
- Extremal problems on the Hamiltonicity of claw-free graphs
- Heavy subgraphs, stability and Hamiltonicity
- Degree conditions restricted to induced paths for Hamiltonicity of claw-heavy graphs
- Induced nets and Hamiltonicity of claw-free graphs
- scientific article; zbMATH DE number 6302876 (Why is no real title available?)
- Forbidden subgraphs that imply 2-factors
- Minimal induced subgraphs of the class of 2-connected non-Hamiltonian wheel-free graphs
- Forbidden set of induced subgraphs for 2-connected supereulerian graphs
- Minimal \(k\)-connected non-Hamiltonian graphs
- Minimal induced subgraphs of two classes of 2-connected non-Hamiltonian graphs
- Forbidden pairs of disconnected graphs for supereulerianity of connected graphs
- Induced subgraphs with large degrees at end-vertices for Hamiltonicity of claw-free graphs
- Nonhamiltonian 2-connected claw-free graphs with large 4-degree sum
- Hamiltonian claw-free graphs involving minimum degrees
- Forbidden pairs for spanning (closed) trails
- Solution to a problem on Hamiltonicity of graphs under Ore- and Fan-type heavy subgraph conditions
- A characterization of 2-connected \(\{ K_{1 , 3} , N_{3 , 1 , 1} \}\)-free non-Hamiltonian graphs
This page was built for publication: Minimal \(2\)-connected non-Hamiltonian claw-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584413)