Every 3-connected claw-free B_{i;7-i}-free graph is Hamiltonian
In this paper we have proved that every 3-connected K_{1;3}B_{2;5} (or K_{1;3}B_{3;4})-free graph is Hamiltonian.
Saved in:
Main Authors: | , |
---|---|
格式: | Article |
語言: | English |
出版: |
Science & Knowledge Publishing Corporation Limited
2012
|
主題: | |
在線閱讀: | http://irep.iium.edu.my/27978/1/THREE_CONNECTED_CLAW_FREE-JMCS.pdf http://irep.iium.edu.my/27978/ http://scik.org/index.php/jmcs/article/view/158 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
總結: | In this paper we have proved that every 3-connected K_{1;3}B_{2;5} (or K_{1;3}B_{3;4})-free graph is
Hamiltonian. |
---|