Note on the longest paths in {K
1,4, K
1,4 + e}-free graphs |
| |
| Authors: | Fang Duan Guo Ping Wang |
| |
| Institution: | 1. School of Mathematical Sciences, Xinjiang Normal University, Urumqi, 830054, P. R. China
|
| |
| Abstract: | A graph G is {K 1,4, K 1,4 + e}-free if G contains no induced subgraph isomorphic to K 1,4 or K 1,4 +e. In this paper, we show that G has a path which is either hamiltonian or of length at least 2δ + 2 if G is a connected {K 1,4, K 1,4 + e}-free graph on at least 7 vertices. |
| |
| Keywords: | {K1 4 Kl 4 ＋ e}-free graph longest path hamiltonian path |
| 本文献已被 CNKI 维普 SpringerLink 等数据库收录！ |
|
