|
|||||
|
|
On the s-hamiltonianicity of an hourglass-free line graph |
|
| Institution: | 1. Department of Mathematics, Beijing Jiaotong University, Beijing 100044, China;2. Faculty of Information Technology, Macau University of Science and Technology, Macau, China;3. Department of Mathematics, West Virginia University, Morgantown, WV 26506, USA |
| Abstract: | |
| Keywords: | Fault-tolerant networks Polynomial algorithm Line graph Hourglass-free graph |
| 本文献已被 ScienceDirect 等数据库收录！ | |