{"id":"https://openalex.org/W43428552","doi":"https://doi.org/10.1007/978-3-642-16926-7_8","title":"Narrowing Down the Gap on the Complexity of Coloring P k -Free Graphs","display_name":"Narrowing Down the Gap on the Complexity of Coloring P k -Free Graphs","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W43428552","doi":"https://doi.org/10.1007/978-3-642-16926-7_8","mag":"43428552"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-16926-7_8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-16926-7_8","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":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://durham-repository.worktribe.com/output/1154398","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068613759","display_name":"Hajo Broersma","orcid":"https://orcid.org/0000-0002-4678-3210"},"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":"Hajo Broersma","raw_affiliation_strings":["School of Engineering and Computing Sciences, Science Laboratories, Durham University, Durham, UK","School of Engineering and Computing Sciences, Durham University, Science Laboratories, Durham, UK#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Engineering and Computing Sciences, Science Laboratories, Durham University, Durham, UK","institution_ids":["https://openalex.org/I190082696"]},{"raw_affiliation_string":"School of Engineering and Computing Sciences, Durham University, Science Laboratories, Durham, UK#TAB#","institution_ids":["https://openalex.org/I190082696"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051709720","display_name":"Petr A. Golovach","orcid":"https://orcid.org/0000-0002-2619-2990"},"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":false,"raw_author_name":"Petr A. Golovach","raw_affiliation_strings":["School of Engineering and Computing Sciences, Science Laboratories, Durham University, Durham, UK","School of Engineering and Computing Sciences, Durham University, Science Laboratories, Durham, UK#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Engineering and Computing Sciences, Science Laboratories, Durham University, Durham, UK","institution_ids":["https://openalex.org/I190082696"]},{"raw_affiliation_string":"School of Engineering and Computing Sciences, Durham University, Science Laboratories, Durham, UK#TAB#","institution_ids":["https://openalex.org/I190082696"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027487467","display_name":"Dani\u00ebl Paulusma","orcid":"https://orcid.org/0000-0001-5945-9287"},"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":false,"raw_author_name":"Dani\u00ebl Paulusma","raw_affiliation_strings":["School of Engineering and Computing Sciences, Science Laboratories, Durham University, Durham, UK","School of Engineering and Computing Sciences, Durham University, Science Laboratories, Durham, UK#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Engineering and Computing Sciences, Science Laboratories, Durham University, Durham, UK","institution_ids":["https://openalex.org/I190082696"]},{"raw_affiliation_string":"School of Engineering and Computing Sciences, Durham University, Science Laboratories, Durham, UK#TAB#","institution_ids":["https://openalex.org/I190082696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057091449","display_name":"Jian Song","orcid":"https://orcid.org/0000-0001-6895-0385"},"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":false,"raw_author_name":"Jian Song","raw_affiliation_strings":["School of Engineering and Computing Sciences, Science Laboratories, Durham University, Durham, UK","School of Engineering and Computing Sciences, Durham University, Science Laboratories, Durham, UK#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Engineering and Computing Sciences, Science Laboratories, Durham University, Durham, UK","institution_ids":["https://openalex.org/I190082696"]},{"raw_affiliation_string":"School of Engineering and Computing Sciences, Durham University, Science Laboratories, Durham, UK#TAB#","institution_ids":["https://openalex.org/I190082696"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5068613759"],"corresponding_institution_ids":["https://openalex.org/I190082696"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.4649,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.79650273,"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":"63","last_page":"74"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"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":1.0,"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.9993000030517578,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991999864578247,"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/combinatorics","display_name":"Combinatorics","score":0.810019850730896},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6326667666435242},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.47757747769355774},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4472120404243469},{"id":"https://openalex.org/keywords/greedy-coloring","display_name":"Greedy coloring","score":0.4411331117153168},{"id":"https://openalex.org/keywords/induced-path","display_name":"Induced path","score":0.4399503469467163},{"id":"https://openalex.org/keywords/complete-coloring","display_name":"Complete coloring","score":0.43624347448349},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.4362127184867859},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.4334399402141571},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.43142324686050415},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40222427248954773},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.258428692817688},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.20646682381629944},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.18872195482254028},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.15072953701019287},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.11784350872039795}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.810019850730896},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6326667666435242},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.47757747769355774},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4472120404243469},{"id":"https://openalex.org/C38767284","wikidata":"https://www.wikidata.org/wiki/Q5601715","display_name":"Greedy coloring","level":5,"score":0.4411331117153168},{"id":"https://openalex.org/C58228413","wikidata":"https://www.wikidata.org/wiki/Q15704639","display_name":"Induced path","level":5,"score":0.4399503469467163},{"id":"https://openalex.org/C21642379","wikidata":"https://www.wikidata.org/wiki/Q3342988","display_name":"Complete coloring","level":5,"score":0.43624347448349},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4362127184867859},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.4334399402141571},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.43142324686050415},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40222427248954773},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.258428692817688},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.20646682381629944},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.18872195482254028},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.15072953701019287},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.11784350872039795},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-642-16926-7_8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-16926-7_8","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"},{"id":"pmh:oai:durham-repository.worktribe.com:1154398","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1154398","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":"Presentation / Conference Contribution"}],"best_oa_location":{"id":"pmh:oai:durham-repository.worktribe.com:1154398","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1154398","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":"Presentation / Conference Contribution"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1509433326","https://openalex.org/W1524265383","https://openalex.org/W1539444946","https://openalex.org/W1550397373","https://openalex.org/W1866795302","https://openalex.org/W1882281809","https://openalex.org/W1968069760","https://openalex.org/W2011039300","https://openalex.org/W2012329067","https://openalex.org/W2030398678","https://openalex.org/W2089191641","https://openalex.org/W2089417393","https://openalex.org/W2133251030","https://openalex.org/W2156678756","https://openalex.org/W2160153943","https://openalex.org/W2166566648","https://openalex.org/W2175372374","https://openalex.org/W2282776087","https://openalex.org/W2611093227","https://openalex.org/W3158027121","https://openalex.org/W4232896595","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2793500002","https://openalex.org/W4291316360","https://openalex.org/W4297911588","https://openalex.org/W151506147","https://openalex.org/W1542397451","https://openalex.org/W4294957130","https://openalex.org/W4298054421","https://openalex.org/W4311345810","https://openalex.org/W4385805388","https://openalex.org/W2902139814"],"abstract_inverted_index":null,"counts_by_year":[{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}