A Sufficient Condition For A Graph To Be Traceable
Shijun, Ren ; Shengzheng, Luo
Nihonkai Math. J., Tome 3 (1992) no. 1, p. 73-80 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
Publié le : 1992-05-15
Classification:  
@article{1273779907,
     author = {Shijun, Ren and Shengzheng, Luo},
     title = {A Sufficient Condition For A Graph To Be Traceable},
     journal = {Nihonkai Math. J.},
     volume = {3},
     number = {1},
     year = {1992},
     pages = { 73-80},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1273779907}
}

Shijun, Ren; Shengzheng, Luo. A Sufficient Condition For A Graph To Be Traceable. Nihonkai Math. J., Tome 3 (1992) no. 1, pp.  73-80. http://gdmltest.u-ga.fr/item/1273779907/