Anti-Ramsey properties of random graphs
Journal of Combinatorial Theory Series B
On complexity and approximability of the labeled maximum/perfect matching problems
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Properly coloured copies and rainbow copies of large graphs with small maximum degree
Random Structures & Algorithms
Labeled Traveling Salesman Problems: Complexity and approximation
Discrete Optimization
Color degree and heterochromatic cycles in edge-colored graphs
European Journal of Combinatorics
Hi-index | 0.05 |