Hamiltonicity in 2-connected graphs with claws
From MaRDI portal
Several papers have been written on claw-free graphs (a graph is claw-free if it does not contain a copy of \(K_{1,3}\) as an induced subgraph). In particular, \textit{M. Matthews} and \textit{D. Sumner} [J. Graph Theory 8, 139-146 (1984; Zbl 0536.05047); ibid. 9, 269-277 (1985; Zbl 0591.05041)] considered conditions under which a claw-free graph is hamiltonian. In the present paper the authors consider conditions for a 2-connected graph with claws to be hamiltonian.
Recommendations
Cites work
- Dominating cycles in regular 3-connected graphs
- Graph theory
- Hamilton cycles in claw-free graphs
- Hamiltonian cycles in 3-connected claw-free graphs
- Hamiltonian cycles in 3‐connected claw‐free graphs
- Hamiltonian cycles in 2-connected claw-free graphs
- Hamiltonian results inK1,3-free graphs
- Longest paths and cycles in K1,3-free graphs
- On Hamiltonian claw-free graphs
- Some Theorems on Abstract Graphs
- Toughness and hamiltonicity in almost claw-free graphs
Cited in
(10)- Claw-free graphs---a survey
- Hamiltonicity of 2-connected claw-center independent graphs
- Neighborhood conditions for graphs with induced claws
- \(D_ \lambda\)-cycles in 3-cyclable graphs
- Sufficient condition for Hamiltonicity of \(N_2\)-locally connected claw-free graphs
- On stability of Hamilton-connectedness under the 2-closure in claw-free graphs
- Hamiltonicity in Partly claw-free graphs
- scientific article; zbMATH DE number 5631247 (Why is no real title available?)
- Extremal problems for forbidden pairs that imply hamiltonicity
- scientific article; zbMATH DE number 4183448 (Why is no real title available?)
This page was built for publication: Hamiltonicity in 2-connected graphs with claws
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1382829)
