On the complexity of some Hamiltonian and Eulerian problems in edge-colored complete graphs (Extended abstract)

Benkouar, A.; Manoussakis, Yannis; Paschos, Vangelis; Saad, Rachid

Benkouar, A.; Manoussakis, Yannis; Paschos, Vangelis; Saad, Rachid (1991), On the complexity of some Hamiltonian and Eulerian problems in edge-colored complete graphs (Extended abstract), in Hsu, Wen-Lian; Lee, R.C.T., ISA '91 Algorithms 2nd International Symposium on Algorithms, Taipei, Republic of China [sic], December 16-18, 1991. Proceedings, Springer : Berlin, p. 190-198. http://dx.doi.org/10.1007/3-540-54945-5_62

Type

Communication / Conférence

Date

1991

Conference title

2nd International Symposium on Algorithms (ISA'91)

Conference date

1991-12

Conference city

Taipei

Conference country

Taïwan

Book title

ISA '91 Algorithms 2nd International Symposium on Algorithms, Taipei, Republic of China [sic], December 16-18, 1991. Proceedings

Book author

Hsu, Wen-Lian; Lee, R.C.T.

Publisher

Springer

Series title

Lecture Notes in Computer Science

Series number

557

Published in

Berlin

ISBN

978-3-540-54945-1

Number of pages

396

Pages

190-198

Subjects / Keywords

Euler; Hamilton; Graphs