{"id":"https://openalex.org/W4409983808","doi":"https://doi.org/10.46298/dmtcs.13212","title":"Approximating Maximum Edge 2-Coloring by Normalizing Graphs","display_name":"Approximating Maximum Edge 2-Coloring by Normalizing Graphs","publication_year":2025,"publication_date":"2025-05-01","ids":{"openalex":"https://openalex.org/W4409983808","doi":"https://doi.org/10.46298/dmtcs.13212"},"language":"en","primary_location":{"id":"doi:10.46298/dmtcs.13212","is_oa":true,"landing_page_url":"https://doi.org/10.46298/dmtcs.13212","pdf_url":null,"source":{"id":"https://openalex.org/S200334879","display_name":"Discrete Mathematics & Theoretical Computer Science","issn_l":"1365-8050","issn":["1365-8050","1462-7264"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4328141799","host_organization_name":"French association","host_organization_lineage":["https://openalex.org/P4328141799"],"host_organization_lineage_names":["French association"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics & Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.46298/dmtcs.13212","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5041355842","display_name":"Tobias M\u00f6mke","orcid":"https://orcid.org/0000-0002-2509-6972"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tobias M\u00f6mke","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101949587","display_name":"Alexandru Popa","orcid":"https://orcid.org/0000-0002-7123-1880"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alexandru Popa","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064419638","display_name":"Aida Roshany-Tabrizi","orcid":"https://orcid.org/0009-0003-3607-9611"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Aida Roshany-Tabrizi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5093554601","display_name":"Michael Ruderer","orcid":"https://orcid.org/0009-0009-1968-4821"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michael Ruderer","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5055303116","display_name":"Roland Vincze","orcid":"https://orcid.org/0000-0002-5997-6564"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Roland Vincze","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.09486495,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"vol. 27:2","issue":"Discrete Algorithms","first_page":null,"last_page":null},"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.9782000184059143,"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.9782000184059143,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.9213126301765442},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.712959885597229},{"id":"https://openalex.org/keywords/edge-coloring","display_name":"Edge coloring","score":0.6223019957542419},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.587656557559967},{"id":"https://openalex.org/keywords/brooks-theorem","display_name":"Brooks' theorem","score":0.4516706168651581},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.24082499742507935},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.23315823078155518},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.21935564279556274},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.05721136927604675},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.045206546783447266},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.038536667823791504}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.9213126301765442},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.712959885597229},{"id":"https://openalex.org/C123809776","wikidata":"https://www.wikidata.org/wiki/Q1050972","display_name":"Edge coloring","level":5,"score":0.6223019957542419},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.587656557559967},{"id":"https://openalex.org/C51658606","wikidata":"https://www.wikidata.org/wiki/Q512897","display_name":"Brooks' theorem","level":5,"score":0.4516706168651581},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.24082499742507935},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.23315823078155518},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.21935564279556274},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.05721136927604675},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.045206546783447266},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.038536667823791504},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.46298/dmtcs.13212","is_oa":true,"landing_page_url":"https://doi.org/10.46298/dmtcs.13212","pdf_url":null,"source":{"id":"https://openalex.org/S200334879","display_name":"Discrete Mathematics & Theoretical Computer Science","issn_l":"1365-8050","issn":["1365-8050","1462-7264"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4328141799","host_organization_name":"French association","host_organization_lineage":["https://openalex.org/P4328141799"],"host_organization_lineage_names":["French association"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics & Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:0e4d668afdab4bd499b36bdc54a6f54e","is_oa":true,"landing_page_url":"https://doaj.org/article/0e4d668afdab4bd499b36bdc54a6f54e","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Discrete Mathematics & Theoretical Computer Science, Vol vol. 27:2, Iss Discrete Algorithms (2025)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.46298/dmtcs.13212","is_oa":true,"landing_page_url":"https://doi.org/10.46298/dmtcs.13212","pdf_url":null,"source":{"id":"https://openalex.org/S200334879","display_name":"Discrete Mathematics & Theoretical Computer Science","issn_l":"1365-8050","issn":["1365-8050","1462-7264"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4328141799","host_organization_name":"French association","host_organization_lineage":["https://openalex.org/P4328141799"],"host_organization_lineage_names":["French association"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics & Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2352363476","https://openalex.org/W4401961241","https://openalex.org/W4387838689","https://openalex.org/W1758674513","https://openalex.org/W3191650367","https://openalex.org/W1978273318","https://openalex.org/W4394653164","https://openalex.org/W2573526532","https://openalex.org/W74836192"],"abstract_inverted_index":{"In":[0],"a":[1,10,42,55,73,84,95,128,133,163],"simple,":[2],"undirected":[3],"graph":[4,43,57,82,126,140,151,158],"G,":[5],"an":[6,38,114],"edge":[7,32,39],"2-coloring":[8,33,40],"is":[9,19,35,76,101,105,110,132,141,152,159,162],"coloring":[11],"of":[12,52,98,148],"the":[13,46,50,71,80,87,124,139,145,149,157],"edges":[14,22],"such":[15],"that":[16,103,108,122],"no":[17],"vertex":[18],"incident":[20],"to":[21,36,48,93,112],"with":[23,45],"more":[24],"than":[25,118],"2":[26],"distinct":[27],"colors.":[28,53],"The":[29],"problem":[30,72],"maximum":[31,146],"(ME2C)":[34],"find":[37],"in":[41,67],"G":[44],"goal":[47],"maximize":[49],"number":[51],"For":[54,70],"relevant":[56],"class,":[58],"ME2C":[59,104,169],"models":[60],"anti-Ramsey":[61],"numbers":[62],"and":[63,78,107,137],"it":[64,109],"was":[65],"considered":[66],"network":[68],"applications.":[69],"2-approximation":[74],"algorithm":[75,89,167],"known,":[77],"if":[79,123,138,144],"input":[81,125,150],"has":[83,90,127],"perfect":[85,129],"matching,":[86,130],"same":[88],"been":[91],"shown":[92],"have":[94],"performance":[96],"guarantee":[97],"5/3.":[99],"It":[100],"known":[102],"APX-hard":[106],"UG-hard":[111],"obtain":[113],"approximation":[115],"ratio":[116],"better":[117],"1.5.":[119],"We":[120],"show":[121],"there":[131,161],"polynomial":[134,164],"time":[135,165],"1.625-approximation":[136],"claw-free":[142],"or":[143],"degree":[147],"at":[153,178],"most":[154],"three":[155],"(i.e.,":[156],"subcubic),":[160],"1.5-approximation":[166],"for":[168],"Comment:":[170],"24":[171],"pages,":[172],"6":[173],"figures,":[174],"preliminary":[175],"version":[176],"published":[177],"WAOA":[179],"2023":[180]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}