Subject
Applied Mathematics,Computational Mathematics
Reference16 articles.
1. Reachability problems in edge-colored digraphs;Arpin;Discrete Math.,2007
2. Digraphs: theory;Bang-Jensen,2000
3. Kernels by properly colored paths in arc-colored digraphs;Bai;Discrete Math.,2018
4. On the Computational Complexity of Finding a Kernel;Chvátal,1973
5. H-paths in 2-colored tournaments;Contreras-Balbuena;Int. J. Contemp. Math. Sci.,2015
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. (H, k)-reachability in H-arc-colored digraphs;Boletín de la Sociedad Matemática Mexicana;2022-12-28