Premium
Hamiltonicity for K 1, r ‐free graphs
Author(s) -
Chen Guantao,
Schelp R. H.
Publication year - 1995
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190200406
Subject(s) - combinatorics , mathematics , independence number , hamiltonian (control theory) , hamiltonian path , upper and lower bounds , graph , discrete mathematics , mathematical analysis , mathematical optimization
In this paper, we investigate the Hamiltonicity of K 1,r ‐free graphs with some degree conditions. In particular, let G be a k ‐connected grph of order n ≧3 which is K 1,4 ‐free. Iffor every independent set { v 0 , v 1 , …, v k } then G is hamiltonian. We use an upper bound for the independence number of K 1,r ‐free graphs to extent the above result to K 1,r ‐free graphs. Hamiltonian connected and, more generally, q ‐edge hamiltonian properties are studied here as well. © 1995 John Wiley & Sons, Inc.