Forbidden subgraphs, stability and hamiltonicity
From MaRDI portal
Publication:1292819
Recommendations
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?)
- Closure and stable Hamiltonian properties in claw-free graphs
- Forbidden subgraphs and Hamiltonian properties and graphs
- Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
- Graph theory
- Minimal \(2\)-connected non-Hamiltonian claw-free graphs
- On a closure concept in claw-free graphs
- Sufficient conditions for a graph to be Hamiltonian
Cited in
(16)- A HAMILTONIAN CONNECTIVITY PROPERTY OF REGULAR GRAPHS WITH FORBIDDEN SUBGRAPHS
- Forcing Hamiltonicity in locally finite graphs via forbidden induced subgraphs I: Nets and bulls
- Potential forbidden triples implying hamiltonicity: for sufficiently large graphs
- On Hamiltonicity of 3-connected claw-free graphs
- Forbidden subgraphs that imply 2-factors
- On the Caccetta-Häggkvist conjecture with forbidden subgraphs
- The edge-closure concept for claw-free graphs and the stability of forbidden subgraphs
- Pairs of forbidden subgraphs and 2-connected supereulerian graphs
- Forbidden subgraphs that imply hamiltonian‐connectedness*
- Stability of hereditary graph classes under closure operations
- Hamiltonicity and forbidden subgraphs in 4‐connected graphs
- On stability of the Hamiltonian index under cycle closure
- The local structure of claw-free graphs without induced generalized bulls
- Forbidden configurations for hypohamiltonian graphs
- Closure and forbidden pairs for Hamiltonicity
- Hamiltonian properties of 3-connected \{claw,hourglass\}-free graphs
This page was built for publication: Forbidden subgraphs, stability and hamiltonicity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292819)