Contents

Ars Combinatoria

  • Research article

A Sufficient Condition for Quasi-Claw-Free Hamiltonian Graphs

Jou-Ming Chang1, An-Hang Chen1,2
1Department of Information Management, National Taipei College of Business, Taipei, Taiwan, ROC
2Department of Information Management, National Taiwan University of Science and Technology, Taipei, Taiwan, ROC
  • Published: 31/01/2006

Abstract

There are several well-known and important Hamiltonian results for claw-free graphs, but only a few are concerned with quasi-claw-free graphs. In this note, we provide a new sufficient condition for quasi-claw-free Hamiltonian graphs.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Jou-Ming Chang, An-Hang Chen. A Sufficient Condition for Quasi-Claw-Free Hamiltonian Graphs[J], Ars Combinatoria, Volume 078. 15-22. .