A Cycle Theorem for Hamiltonian Graphs without K1,3
Received:June 26, 1995  
Key Words: K1.3-free graph   hamiltonian graph   pancyclic graph  
Fund Project:
Author NameAffiliation
Ren Han Department of Mathematics
Northern Jiaotong University
Beijin 100044 
Hits: 1844
Download times: 1094
Abstract:
      Let G=(V, E) be a hamiltonian K1.3-free graph such that d(x)≧|V|/2 and G[N(x)] is connected for some vertex x of G . Then G is pancyclic with a few number of exceptions.
Citation:
DOI:10.3770/j.issn:1000-341X.1998.02.002
View Full Text  View/Add Comment  
  Copyright © Journal of Mathematical Research with Applications
Sponsored by：Dalian University of Technology, China Society for Industrial and Applied Mathematics
Address：No.2 Linggong Road, Ganjingzi District, Dalian City, Liaoning Province, P. R. China , Postal code ：116024
Service Tel：86-411-84707392 Email：jmre@dlut.edu.cn
Designed by Beijing E-tiller Co.,Ltd.
Due to security factors, early browsers cannot log in. It is recommended to log in with IE10, IE11, Google, Firefox, and 360 new browsers.