On the Complexity of Some Hamiltonian and Eulerian Problems in Edge-Colored Complete Graphs

Authors:
A. Benkouar;Yannis Manoussakis;Vangelis Th. Paschos;Rachid Saad
Affiliations:
-;-;-;-
Venue:
ISA '91 Proceedings of the 2nd International Symposium on Algorithms
Year:
1991

Citing 0
Cited 3

Complexity of Compatible Decompositions of Eulerian Graphs and Their Transformations

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
The number of 2-edge-colored complete graphs with unique Hamiltonian alternating cycle

Discrete Mathematics
Properly Coloured Cycles and Paths: Results and Open Problems

Graph Theory, Computational Intelligence and Thought

Quantified Score

Hi-index	0.00

Visualization

Abstract