Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference7 articles.
1. A short proof of the Chen–Manalastas theorem;Bondy;Discrete Math.,1995
2. Chemins et circuits hamiltoniens des graphes complets;Camion;C. R. Acad. Sci. Paris,1959
3. Every finite strongly connected digraph of stability 2 has a Hamiltonian path;Chen;Discrete Math.,1983
4. On directed paths and circuits;Gallai,1968
5. Independent sets and longest directed paths in digraphs;Laborde,1983
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Beautiful conjectures in graph theory;European Journal of Combinatorics;2014-04
2. Independent detour transwersals in 3-deficient digraphs;Discussiones Mathematicae Graph Theory;2013
3. A survey of the Path Partition Conjecture;Discussiones Mathematicae Graph Theory;2013
4. Traceability of k-traceable oriented graphs;Discrete Mathematics;2010-04
5. WHEN DO THREE LONGEST PATHS HAVE A COMMON VERTEX?;Discrete Mathematics, Algorithms and Applications;2009-03