## Abstract

Let cl(G) denote Ryjáček's closure of a claw-free graph G. In this article, we prove the following result. Let G be a 4-connected claw-free graph. Assume that G[N_{G}(T)] is cyclically 3-connected if T is a maximal K_{3} in G which is also maximal in cl(G). Then G is hamiltonian. This result is a common generalization of Kaiser et al.'s theorem [J Graph Theory 48(4) (2005), 267-276] and Pfender's theorem [J Graph Theory 49(4) (2005), 262-272].

Original language | English |
---|---|

Pages (from-to) | 40-53 |

Number of pages | 14 |

Journal | Journal of Graph Theory |

Volume | 70 |

Issue number | 1 |

DOIs | |

Publication status | Published - 2012 May |

## Keywords

- Hamiltonian cycle
- claw-free graph

## ASJC Scopus subject areas

- Geometry and Topology

## Fingerprint

Dive into the research topics of 'Maximal K_{3}'s and Hamiltonicity of 4-connected claw-free graphs'. Together they form a unique fingerprint.