Author:
Mehedy Lenin,Hasan M. Kamrul,Kaykobad Mohammad
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference15 articles.
1. Properly colored Hamiltonian paths in edge-colored complete graphs without monochromatic triangles;Barr;Ars Combin.,1998
2. More progress on tough graphs—the Y2K report;Bauer;Electronic Notes in Discrete Math.,2002
3. More than 1—tough chordal planar graphs are Hamiltonian;Böhme;J. Graph Theory,1999
4. Forbidden subgraphs and the Hamiltonian theme;Duffus,1981
5. Spanning 2-trails from degree sum conditions;Ellingham;J. Graph Theory,2004
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献