Authors: Adamaszek, Anna Maria, Popa, Alexandru

Superior Title: Adamaszek , A M & Popa , A 2016 , ' Approximation and hardness results for the maximum edge q -coloring problem ' , Journal of Discrete Algorithms , vol. 38-41 , pp. 1-8 . https://doi.org/10.1016/j.jda.2016.09.003

Subject Terms: Approximation algorithms, Graph coloring, Hardness of approximation

Availability: https://doi.org/10.1016/j.jda.2016.09.003
https://curis.ku.dk/portal/da/publications/approximation-and-hardness-results-for-the-maximum-edge-qcoloring-problem(9d415f8f-605f-488d-bc86-7978fe600519).html
http://www.scopus.com/inward/record.url?scp=84991813327&partnerID=8YFLogxK

Authors: Kawarabayashi, Ken-ichi, Thorup, Mikkel

Superior Title: Kawarabayashi , K & Thorup , M 2012 , Combinatorial coloring of 3-colorable graphs . in 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science . IEEE , pp. 68-75 , IEEE 53rd Annual Symposium on Foundations of Computer Science , New Brunswick, New Jersey , United States , 20/10/2012 . https://doi.org/10.1109/FOCS.2012.16

Subject Terms: computational complexity, graph colouring, mathematical programming, 3-colorable graph, Õ(n0.2072) colors, Õ(n0. 2049) colors, Õ(n4/11) colors, combinatorial coloring algorithm, polynomial time, semi-definite programming approaches, Algorithm design and analysis, Approximation algorithms, Approximation methods, Color, Computer science, Electronic mail, Polynomials, Graph Coloring

Availability: https://doi.org/10.1109/FOCS.2012.16
https://curis.ku.dk/portal/da/publications/combinatorial-coloring-of-3colorable-graphs(4ca73b18-f9bc-4284-a9dd-6ef10170b5fa).html