{"id":"https://openalex.org/W1873654474","doi":"https://doi.org/10.1007/s00453-014-9949-6","title":"Algorithms and Almost Tight Results for $$3$$ 3 -Colorability of Small Diameter Graphs","display_name":"Algorithms and Almost Tight Results for $$3$$ 3 -Colorability of Small Diameter Graphs","publication_year":2014,"publication_date":"2014-10-20","ids":{"openalex":"https://openalex.org/W1873654474","doi":"https://doi.org/10.1007/s00453-014-9949-6","mag":"1873654474"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-014-9949-6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-014-9949-6","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-014-9949-6.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-014-9949-6.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5018078197","display_name":"George B. Mertzios","orcid":"https://orcid.org/0000-0001-7182-585X"},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"George B. Mertzios","raw_affiliation_strings":[") School of Engineering and Computing Sciences, Durham University, Durham, UK","School of Engineering and Computing Sciences, Durham University, Durham, UK"],"affiliations":[{"raw_affiliation_string":") School of Engineering and Computing Sciences, Durham University, Durham, UK","institution_ids":["https://openalex.org/I190082696"]},{"raw_affiliation_string":"School of Engineering and Computing Sciences, Durham University, Durham, UK","institution_ids":["https://openalex.org/I190082696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011756177","display_name":"Paul G. Spirakis","orcid":"https://orcid.org/0000-0001-5396-3749"},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]},{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Paul G. Spirakis","raw_affiliation_strings":[") School of Engineering and Computing Sciences, Durham University, Durham, UK","Department of Computer Science, University of Liverpool, Liverpool, UK"],"affiliations":[{"raw_affiliation_string":") School of Engineering and Computing Sciences, Durham University, Durham, UK","institution_ids":["https://openalex.org/I190082696"]},{"raw_affiliation_string":"Department of Computer Science, University of Liverpool, Liverpool, UK","institution_ids":["https://openalex.org/I146655781"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5018078197"],"corresponding_institution_ids":["https://openalex.org/I190082696"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2618,"currency":"EUR","value_usd":2823},"fwci":1.4623,"has_fulltext":true,"cited_by_count":21,"citation_normalized_percentile":{"value":0.81060806,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"74","issue":"1","first_page":"385","last_page":"414"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.996399998664856,"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.992900013923645,"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.847070574760437},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7222784161567688},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.5164192318916321},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48370128870010376},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.47298964858055115},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.45907777547836304},{"id":"https://openalex.org/keywords/greedy-coloring","display_name":"Greedy coloring","score":0.43926459550857544},{"id":"https://openalex.org/keywords/brooks-theorem","display_name":"Brooks' theorem","score":0.43695589900016785},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.43667975068092346},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.29311156272888184},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.18313875794410706}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.847070574760437},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7222784161567688},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.5164192318916321},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48370128870010376},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47298964858055115},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.45907777547836304},{"id":"https://openalex.org/C38767284","wikidata":"https://www.wikidata.org/wiki/Q5601715","display_name":"Greedy coloring","level":5,"score":0.43926459550857544},{"id":"https://openalex.org/C51658606","wikidata":"https://www.wikidata.org/wiki/Q512897","display_name":"Brooks' theorem","level":5,"score":0.43695589900016785},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.43667975068092346},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.29311156272888184},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.18313875794410706},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s00453-014-9949-6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-014-9949-6","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-014-9949-6.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:dro.dur.ac.uk.OAI2:13686","is_oa":true,"landing_page_url":"http://dro.dur.ac.uk/13686/","pdf_url":null,"source":{"id":"https://openalex.org/S4377196258","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Algorithmica, 2016, Vol.74(1), pp.385-414 [Peer Reviewed Journal]","raw_type":"Article"},{"id":"pmh:oai:durham-repository.worktribe.com:1421915","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1421915","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"}],"best_oa_location":{"id":"doi:10.1007/s00453-014-9949-6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-014-9949-6","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-014-9949-6.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.4300000071525574,"id":"https://metadata.un.org/sdg/11"}],"awards":[{"id":"https://openalex.org/G6214505137","display_name":null,"funder_award_id":"EP/K022660/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G7325551107","display_name":"Algorithmic Aspects of Intersection Graph Models","funder_award_id":"EP/K022660/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":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1873654474.pdf","grobid_xml":"https://content.openalex.org/works/W1873654474.grobid-xml"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W32530770","https://openalex.org/W1509433326","https://openalex.org/W1533811829","https://openalex.org/W1582963151","https://openalex.org/W1934698557","https://openalex.org/W1968069760","https://openalex.org/W1973322735","https://openalex.org/W1985572324","https://openalex.org/W1986075609","https://openalex.org/W1995725694","https://openalex.org/W1998601876","https://openalex.org/W2011039300","https://openalex.org/W2015963099","https://openalex.org/W2024656522","https://openalex.org/W2028357390","https://openalex.org/W2064521868","https://openalex.org/W2068121436","https://openalex.org/W2068871408","https://openalex.org/W2082242399","https://openalex.org/W2085026045","https://openalex.org/W2102669784","https://openalex.org/W2175372374","https://openalex.org/W2249739104","https://openalex.org/W2282776087","https://openalex.org/W2977322974","https://openalex.org/W4213009134","https://openalex.org/W4242518419","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1542397451","https://openalex.org/W4311345810","https://openalex.org/W183100298","https://openalex.org/W4388160260","https://openalex.org/W4297911588","https://openalex.org/W2380525562","https://openalex.org/W2108189610","https://openalex.org/W3169197204","https://openalex.org/W2793500002","https://openalex.org/W1973571353"],"abstract_inverted_index":{"The":[0],"3-coloring":[1,35,60,148],"problem":[2,61,73],"is":[3,10,21],"well":[4,12],"known":[5,13],"to":[6,23,64,135],"be":[7,37],"NP-complete.":[8],"It":[9],"also":[11],"that":[14,136,154],"it":[15],"remains":[16],"NP-complete":[17],"when":[18],"the":[19,30,59,68,112,129],"input":[20],"restricted":[22],"graphs":[24,44,75,99,104,150],"with":[25,45,62,76,80,100,105,118,151],"diameter":[26,49,81,106,152],"4.":[27,52],"Moreover,":[28],"assuming":[29],"Exponential":[31],"Time":[32],"Hypothesis":[33],"(ETH),":[34],"cannot":[36],"solved":[38],"in":[39],"time":[40],"2":[41,120,153],"o(n)":[42],"on":[43,74,149],"n":[46,122],"vertices":[47],"and":[48,141],"at":[50,82,86,107,156],"most":[51,83,87,108],"In":[53,94],"spite":[54],"of":[55,58,71,131,137],"extensive":[56],"studies":[57],"respect":[63],"several":[65],"basic":[66],"parameters,":[67],"complexity":[69,119],"status":[70],"this":[72,95],"small":[77,101],"diameter,":[78],"i.e.":[79],"2,":[84,109],"or":[85],"3,":[88],"has":[89],"been":[90],"an":[91,132,138],"open":[92],"problem.":[93],"paper":[96],"we":[97,110,127,142],"investigate":[98],"diameter.":[102],"For":[103],"provide":[111,143],"first":[113],"subexponential":[114],"algorithm":[115,146],"for":[116,147],"3-coloring,":[117],"O(":[121],"log":[123],"n)":[124],".":[125],"Furthermore":[126],"extend":[128],"notion":[130],"articulation":[133,139],"vertex":[134],"neighborhood,":[140],"a":[144],"polynomial":[145],"have":[155],"least":[157],"one":[158]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}