Publisher
Springer Nature Switzerland
Reference24 articles.
1. Adamaszek, A., Popa, A.: Approximation and hardness results for the maximum edge Q-coloring problem. J. Discrete Algorithms 38–41, 1–8 (2016)
2. Axenovich, M., Jiang, T.: Anti-Ramsey numbers for small complete bipartite graphs. Ars Comb. 73, 311–318 (2004)
3. Axenovich, M., Jiang, T., Kündgen, A.: Bipartite anti-Ramsey numbers of cycles. J. Graph Theory 47(1), 9–28 (2004)
4. Blokhuis, A., Faudree, R.J., Gyárfás, A., Ruszinkó, M.: Anti-Ramsey colorings in several rounds. J. Comb. Theory. Ser. B 82(1), 1–18 (2001)
5. Chandran, L.S., Lahiri, A., Singh, N.: Improved approximation for maximum edge colouring problem. Discret. Appl. Math. 319, 42–52 (2021)