{"id":"https://openalex.org/W72216225","doi":"https://doi.org/10.1007/978-3-642-17514-5_12","title":"Approximation and Hardness Results for the Maximum Edge q-coloring Problem","display_name":"Approximation and Hardness Results for the Maximum Edge q-coloring Problem","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W72216225","doi":"https://doi.org/10.1007/978-3-642-17514-5_12","mag":"72216225"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-17514-5_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-17514-5_12","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050123676","display_name":"Anna Adamaszek","orcid":"https://orcid.org/0000-0003-3291-0124"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Anna Adamaszek","raw_affiliation_strings":["Centre for Discrete Mathematics and its Applications (DIMAP) and Department of Computer Science, University of Warwick, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Centre for Discrete Mathematics and its Applications (DIMAP) and Department of Computer Science, University of Warwick, UK","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008143115","display_name":"Alexandru Popa","orcid":"https://orcid.org/0000-0003-3364-1210"},"institutions":[{"id":"https://openalex.org/I36234482","display_name":"University of Bristol","ror":"https://ror.org/0524sp257","country_code":"GB","type":"education","lineage":["https://openalex.org/I36234482"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Alexandru Popa","raw_affiliation_strings":["Department of Computer Science, University of Bristol, Bristol, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Bristol, Bristol, UK","institution_ids":["https://openalex.org/I36234482"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.3131,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.43990423,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"132","last_page":"143"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9742000102996826,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.725354015827179},{"id":"https://openalex.org/keywords/complete-coloring","display_name":"Complete coloring","score":0.6203224658966064},{"id":"https://openalex.org/keywords/edge-coloring","display_name":"Edge coloring","score":0.5813989639282227},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5561502575874329},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.549473226070404},{"id":"https://openalex.org/keywords/fractional-coloring","display_name":"Fractional coloring","score":0.5434314608573914},{"id":"https://openalex.org/keywords/brooks-theorem","display_name":"Brooks' theorem","score":0.5048778653144836},{"id":"https://openalex.org/keywords/greedy-coloring","display_name":"Greedy coloring","score":0.5013124942779541},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.49381574988365173},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48957476019859314},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4749215543270111},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.440155029296875},{"id":"https://openalex.org/keywords/list-coloring","display_name":"List coloring","score":0.42185649275779724},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.4176230728626251},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36787909269332886},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.34484583139419556},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.2391355335712433},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.12638148665428162},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1073564887046814},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.06302586197853088}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.725354015827179},{"id":"https://openalex.org/C21642379","wikidata":"https://www.wikidata.org/wiki/Q3342988","display_name":"Complete coloring","level":5,"score":0.6203224658966064},{"id":"https://openalex.org/C123809776","wikidata":"https://www.wikidata.org/wiki/Q1050972","display_name":"Edge coloring","level":5,"score":0.5813989639282227},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5561502575874329},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.549473226070404},{"id":"https://openalex.org/C158319403","wikidata":"https://www.wikidata.org/wiki/Q5477527","display_name":"Fractional coloring","level":5,"score":0.5434314608573914},{"id":"https://openalex.org/C51658606","wikidata":"https://www.wikidata.org/wiki/Q512897","display_name":"Brooks' theorem","level":5,"score":0.5048778653144836},{"id":"https://openalex.org/C38767284","wikidata":"https://www.wikidata.org/wiki/Q5601715","display_name":"Greedy coloring","level":5,"score":0.5013124942779541},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.49381574988365173},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48957476019859314},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4749215543270111},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.440155029296875},{"id":"https://openalex.org/C199594403","wikidata":"https://www.wikidata.org/wiki/Q1130404","display_name":"List coloring","level":5,"score":0.42185649275779724},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.4176230728626251},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36787909269332886},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34484583139419556},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.2391355335712433},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.12638148665428162},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1073564887046814},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.06302586197853088},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-17514-5_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-17514-5_12","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6958986694","display_name":null,"funder_award_id":"EP/D063191/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1567788322","https://openalex.org/W1662911496","https://openalex.org/W2006478220","https://openalex.org/W2010526719","https://openalex.org/W2018330896","https://openalex.org/W2033599053","https://openalex.org/W2058316732","https://openalex.org/W2067528372","https://openalex.org/W2611804663","https://openalex.org/W3165894764","https://openalex.org/W4255016077","https://openalex.org/W4300550233"],"related_works":["https://openalex.org/W4311345810","https://openalex.org/W2042876012","https://openalex.org/W4237246883","https://openalex.org/W2171203708","https://openalex.org/W55620969","https://openalex.org/W2293855371","https://openalex.org/W4287598225","https://openalex.org/W3101541854","https://openalex.org/W3006791531","https://openalex.org/W1982933944"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}