Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results

A. Benkouar, Yannis Manoussakis, Vangélis Th. Paschos, Rachid Saad · RAIRO - Operations Research · 1996

Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity resultsRevue française d'automatique, d'informatique et de recherche opérationnelle.Recherche opérationnelle, tome 30, n o 4 (1996), p. 417-438.

Read the paper · More papers on PaperTik