On the complexity of some Hamiltonian and Eulerian problems in edge-colored complete graphs
Authors:
- 1 January 1991
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 190-198
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Polynomial Algorithms for Finding Cycles and Paths in Bipartite TournamentsSIAM Journal on Discrete Mathematics, 1990
- The directed subgraph homeomorphism problemTheoretical Computer Science, 1980
- Graphs with Hamiltonian cycles having adjacent lines different colorsJournal of Combinatorial Theory, Series B, 1976
- Alternating Hamiltonian cyclesIsrael Journal of Mathematics, 1976
- Graph Theory with Applications1976
- An O (N2.5) algorithm for maximum matching in general graphs1975
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972