|
|||||
|
|
Two completely independent spanning trees of claw-free graphs |
|
| Affiliation: | 1. School of Mathematics, Liaoning Normal University, Dalian 116029, PR China;2. School of Software, Dalian University of Technology, Dalian 116024, PR China;3. School of Mathematics and Statistics, Beijing Key Laboratory on MCAACI, Beijing Institute of Technology, Beijing 100081, PR China |
| Abstract: | |
| Keywords: | Claw-free graphs Two CISTs Eligible vertex |
| 本文献已被 ScienceDirect 等数据库收录！ | |