Minimal 2-connected non-Hamiltonian claw-free graphs

DOI10.1016/S0012-365X(98)00093-4zbMATH Open0958.05086OpenAlexW1995322874MaRDI QIDQ1584413FDOQ1584413

Authors: Jan Brousek 

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

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

zbMATH Keywords

2-connected non-Hamiltonian claw-free graphsforbidden subgraph conditions

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Structural characterization of families of graphs (05C75)

Cites Work

• Graph theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A strengthening of Ben Rebea's lemma

Cited In (22)

• Minimal claw-free graphs
• Heavy subgraphs, stability and Hamiltonicity
• Minimal induced subgraphs of the class of 2-connected non-Hamiltonian wheel-free graphs
• Forbidden pairs of disconnected graphs implying Hamiltonicity
• Minimal \(k\)-connected non-Hamiltonian graphs
• Forbidden set of induced subgraphs for 2-connected supereulerian graphs
• Solution to a problem on Hamiltonicity of graphs under Ore- and Fan-type heavy subgraph conditions
• Forbidden subgraphs for graphs with (near) perfect matching to be Hamiltonian
• Nonhamiltonian 2-connected claw-free graphs with large 4-degree sum
• Degree conditions restricted to induced paths for Hamiltonicity of claw-heavy graphs
• Induced subgraphs with large degrees at end-vertices for Hamiltonicity of claw-free graphs
• Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
• Extremal problems on the Hamiltonicity of claw-free graphs
• Forbidden pairs of disconnected graphs for supereulerianity of connected graphs
• Forbidden subgraphs, stability and hamiltonicity
• Title not available (Why is that?)
• Forbidden subgraphs that imply 2-factors
• Hamiltonian claw-free graphs involving minimum degrees
• Forbidden pairs for spanning (closed) trails
• Induced nets and Hamiltonicity of claw-free graphs
• Minimal induced subgraphs of two classes of 2-connected non-Hamiltonian graphs
• 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)