Conditions on subgraphs, degrees, and domination for Hamiltonian properties of graphs
From MaRDI portal
Publication:2279291
Recommendations
- Degree and neighborhood conditions for Hamiltonicity of claw-free graphs
- Mengerian properties, hamiltonicity, and claw‐free graphs
- scientific article; zbMATH DE number 1782860
- A note on degree conditions for Hamiltonicity in 2-connected claw-free graphs
- Chvátal-Erdős type conditions for Hamiltonicity of claw-free graphs
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- An implicit degree condition for cyclability in graphs
- Disconnected forbidden subgraphs, toughness and Hamilton cycles
- Dominating set and Hamiltonicity in claw-heavy graphs.
- Dominating sets and Hamiltonicity in \(K_{1,3}\)-free graphs
- Fan-type implicit-heavy subgraphs for Hamiltonicity of implicit claw-heavy graphs
- Graph theory with applications
- Hamilton cycles in implicit claw-heavy graphs
- Implicit-degrees and circumferences
Cited in
(4)
This page was built for publication: Conditions on subgraphs, degrees, and domination for Hamiltonian properties of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2279291)