{"id":"https://openalex.org/W2175372374","doi":"https://doi.org/10.1007/978-3-642-10217-2_12","title":"Three Complexity Results on Coloring P k -Free Graphs","display_name":"Three Complexity Results on Coloring P k -Free Graphs","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2175372374","doi":"https://doi.org/10.1007/978-3-642-10217-2_12","mag":"2175372374"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-10217-2_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-10217-2_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":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://durham-repository.worktribe.com/output/1159595","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":["Department of Computer Science, Durham University, DH1 3LE, Durham, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Durham University, DH1 3LE, Durham, United Kingdom","institution_ids":["https://openalex.org/I190082696"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075328697","display_name":"Fedor V. Fomin","orcid":"https://orcid.org/0000-0003-1955-4612"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Fedor V. Fomin","raw_affiliation_strings":["Department of Informatics, University of Bergen, PB 7803, 5020, Bergen, Norway"],"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, PB 7803, 5020, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"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/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Petr A. Golovach","raw_affiliation_strings":["Department of Informatics, University of Bergen, PB 7803, 5020, Bergen, Norway"],"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, PB 7803, 5020, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"last","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":["Department of Computer Science, Durham University, DH1 3LE, Durham, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Durham University, DH1 3LE, Durham, United Kingdom","institution_ids":["https://openalex.org/I190082696"]}]}],"institutions":[],"countries_distinct_count":2,"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":5.261,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.96616464,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"95","last_page":"104"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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.9976999759674072,"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.9958999752998352,"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.728517472743988},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.5793436765670776},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.5544153451919556},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.5258503556251526},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48522210121154785},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4647029936313629},{"id":"https://openalex.org/keywords/greedy-coloring","display_name":"Greedy coloring","score":0.4619268774986267},{"id":"https://openalex.org/keywords/induced-path","display_name":"Induced path","score":0.45801842212677},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.44345730543136597},{"id":"https://openalex.org/keywords/complete-coloring","display_name":"Complete coloring","score":0.4386715292930603},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.4199364483356476},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.3719879686832428},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3430712819099426},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3287840485572815},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.08041805028915405},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.04501214623451233}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.728517472743988},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.5793436765670776},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.5544153451919556},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.5258503556251526},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48522210121154785},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4647029936313629},{"id":"https://openalex.org/C38767284","wikidata":"https://www.wikidata.org/wiki/Q5601715","display_name":"Greedy coloring","level":5,"score":0.4619268774986267},{"id":"https://openalex.org/C58228413","wikidata":"https://www.wikidata.org/wiki/Q15704639","display_name":"Induced path","level":5,"score":0.45801842212677},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.44345730543136597},{"id":"https://openalex.org/C21642379","wikidata":"https://www.wikidata.org/wiki/Q3342988","display_name":"Complete coloring","level":5,"score":0.4386715292930603},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.4199364483356476},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.3719879686832428},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3430712819099426},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3287840485572815},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.08041805028915405},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.04501214623451233},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/978-3-642-10217-2_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-10217-2_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"},{"id":"pmh:oai:ris.utwente.nl:openaire_cris_publications/12e81a75-4eda-4240-bfd7-5ca8c94e513a","is_oa":false,"landing_page_url":"https://research.utwente.nl/en/publications/12e81a75-4eda-4240-bfd7-5ca8c94e513a","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Broersma, H J, Fomin, F V, Golovach, P A & Paulusma, D 2009, Three Complexity Results on Coloring $P_k$-Free Graphs. in J Fiala, J Kratochvil & M Miller (eds), Combinatioral Algorithms - Proceedings of the 20th International Workshop , IWOCA 2009., 10.1007/978-3-642-10217-2_12, Lecture Notes in Computer Science, vol. 5874, Springer, Berlin, pp. 95-104, 20th International Workshop on Combinatioral Algorithms, IWOCA 2009, Hradec nad Moravic\u00ed, Czech Republic, 28/06/09. https://doi.org/10.1007/978-3-642-10217-2_12","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:dro.dur.ac.uk.OAI2:6284","is_oa":false,"landing_page_url":"http://dro.dur.ac.uk/6284/","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":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Fiala, J. & Kratochv\u00edl, J. & Miller, M. (Eds.). (2009). Combinatorial algorithms : 20th InternationalWorkshop, IWOCA 2009, 28 June - 2 July 2009, Hradec nad Moravic\u00ed, Czech Republic ; revised selected papers. Berlin: Springer, pp. 95-104, Lecture notes in computer science(5874)","raw_type":"Book chapter"},{"id":"pmh:oai:durham-repository.worktribe.com:1159595","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1159595","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"},{"id":"pmh:oai:ris.utwente.nl:publications/12e81a75-4eda-4240-bfd7-5ca8c94e513a","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"pmh:oai:durham-repository.worktribe.com:1159595","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1159595","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":[{"id":"https://openalex.org/G1111885211","display_name":null,"funder_award_id":"EP/G043434/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G3476746706","display_name":null,"funder_award_id":"EP/D053633/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":18,"referenced_works":["https://openalex.org/W1509433326","https://openalex.org/W1524265383","https://openalex.org/W1529177751","https://openalex.org/W1550397373","https://openalex.org/W1866795302","https://openalex.org/W1882281809","https://openalex.org/W1968069760","https://openalex.org/W2011039300","https://openalex.org/W2029890572","https://openalex.org/W2089191641","https://openalex.org/W2138290101","https://openalex.org/W2156678756","https://openalex.org/W2160153943","https://openalex.org/W2282776087","https://openalex.org/W2611093227","https://openalex.org/W2987461903","https://openalex.org/W4232896595","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2950380069","https://openalex.org/W4207053563","https://openalex.org/W2974375505","https://openalex.org/W65332180","https://openalex.org/W264180933","https://openalex.org/W2911678318","https://openalex.org/W3198239652","https://openalex.org/W2914970624","https://openalex.org/W4297873992","https://openalex.org/W2750836845"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":9}],"updated_date":"2026-01-15T23:16:33.117629","created_date":"2025-10-10T00:00:00"}