Approximation and Hardness Results for the Maximum Edge q-coloring Problem-Reference-Cited by-同舟云学术

Approximation and Hardness Results for the Maximum Edge q-coloring Problem

Published:2010 Issue: Volume: Page:132-143
ISSN:0302-9743
Container-title:Algorithms and Computation
language:
Short-container-title:

Author:

Adamaszek Anna,Popa Alexandru

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-17514-5_12

Reference11 articles.

1. Erdős, P., Simonovits, M., Sós, V.T.: Anti-ramsey theorems. In: Infinite and finite sets (Colloq., Keszthely, 1973; dedicated to P. Erdős on his 60th birthday), Vol. II, vol. 10, pp. 633–643. Colloq. Math. Soc. János Bolyai (1975)

2. Feng, W., Chen, P., Zhang, B.: Approximate maximum edge coloring within factor 2: a further analysis. In: ISORA, pp. 182–189 (2008)

3. Lecture Notes in Computer Science;W. Feng,2007

4. Feng, W., Zhang, L., Wang, H.: Approximation algorithm for maximum edge coloring. Theor. Comput. Sci. 410(11), 1022–1029 (2009)

5. Fujita, S., Magnant, C., Ozeki, K.: Rainbow generalizations of ramsey theory: A survey. Graphs and Combinatorics (2010)

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Maximum Edge Colouring Problem On Graphs That Exclude a Fixed Minor;Graph-Theoretic Concepts in Computer Science;2023

2. Improved approximation for maximum edge colouring problem;Discrete Applied Mathematics;2021-06

3. Heuristic Algorithms for the Min-Max Edge 2-Coloring Problem;Lecture Notes in Computer Science;2018

4. Approximation and hardness results for the maximum edge q-coloring problem;Journal of Discrete Algorithms;2016-05

5. The Min-max Edge q-Coloring Problem;Lecture Notes in Computer Science;2015