![]() | ![]() |
Ask others: ACM DL/Guide -
- CSB - MetaPress - Google - Bing - Yahoo
| 1 | A. Benkouar, Yannis Manoussakis, Vangelis Th. Paschos, Rachid Saad: On the Complexity of Some Hamiltonian and Eulerian Problems in Edge-Colored Complete Graphs. ISA 1991: 190-198 |
Selection of 1 from 2 records - A. Benkouar has 3 coauthors
Last update 2012-09-10 CET by the DBLP Team —
Content released under the ODC-BY 1.0 license — See also our legal information page