Hamiltonicity of {K1,4,K1,4 + e}-free graphs

Authors:
Rao Li;R. H. Schelp
Affiliations:
School of Computer and Information Sciences, Georgia Southwestern State University, Americus, GA;Department of Mathematical Sciences, The University of Memphis, Memphis, TN
Venue:
Discrete Mathematics
Year:
2002

Citing 3
Cited 0

Hamiltonian cycles in 3-connected claw-free graphs

Journal of Graph Theory
Hamiltonicity for K1,r-free graphs

Journal of Graph Theory
Graph Theory With Applications

Graph Theory With Applications

Quantified Score

Hi-index	0.05

Visualization

Abstract

A graph G is called {H1, H2,...,Hk}-free if G contains no induced subgraph isomorphic to any Hi, 1 ≤ i ≤ k. Let G be a 3-connected {K1,4,,K1,4 + e}-free graphs of order n ≥ 30. If δ(G)≥(n + 5)/5, then G is hamiltonian, where K1,4+e is a graph obtained by joining a pair of nonadjacent vertices in a K1,4.