{"id":"https://openalex.org/W1882281809","doi":"https://doi.org/10.1007/3-540-45477-2_23","title":"Complexity of Coloring Graphs without Forbidden Induced Subgraphs","display_name":"Complexity of Coloring Graphs without Forbidden Induced Subgraphs","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W1882281809","doi":"https://doi.org/10.1007/3-540-45477-2_23","mag":"1882281809"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-45477-2_23","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45477-2_23","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5027559065","display_name":"Daniel Kr\u00e1l\u034f\u030c","orcid":"https://orcid.org/0000-0001-8680-0890"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Daniel Kr\u00e1l\u2019","raw_affiliation_strings":["Department of Applied Mathematics and Institute for Theoretical Computer Science, Charles University, Malostransk\u00e9 n\u00e1m. 25, 118 00, Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics and Institute for Theoretical Computer Science, Charles University, Malostransk\u00e9 n\u00e1m. 25, 118 00, Prague, Czech Republic","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066646775","display_name":"Jan Kratochv\u0131\u0301l","orcid":"https://orcid.org/0000-0002-2620-6133"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Jan Kratochv\u00edl","raw_affiliation_strings":["Department of Applied Mathematics and Institute for Theoretical Computer Science, Charles University, Malostransk\u00e9 n\u00e1m. 25, 118 00, Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics and Institute for Theoretical Computer Science, Charles University, Malostransk\u00e9 n\u00e1m. 25, 118 00, Prague, Czech Republic","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5107094827","display_name":"Zsolt Tuza","orcid":null},"institutions":[{"id":"https://openalex.org/I7597260","display_name":"Hungarian Academy of Sciences","ror":"https://ror.org/02ks8qq67","country_code":"HU","type":"funder","lineage":["https://openalex.org/I7597260"]},{"id":"https://openalex.org/I4210117195","display_name":"Institute for Computer Science and Control","ror":"https://ror.org/0249v7n71","country_code":"HU","type":"facility","lineage":["https://openalex.org/I4210117195","https://openalex.org/I7597260"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Zsolt Tuza","raw_affiliation_strings":["Computer and Automation Institute, Hungarian Academy of Sciences, H-1111, Budapest, Kende u. 13-17, Hungary","Department of Computer Science, Hungary"],"affiliations":[{"raw_affiliation_string":"Computer and Automation Institute, Hungarian Academy of Sciences, H-1111, Budapest, Kende u. 13-17, Hungary","institution_ids":["https://openalex.org/I7597260"]},{"raw_affiliation_string":"Department of Computer Science, Hungary","institution_ids":["https://openalex.org/I4210117195"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080746477","display_name":"Gerhard J. Woeginger","orcid":"https://orcid.org/0000-0001-8816-2693"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gerhard J. Woeginger","raw_affiliation_strings":["Technical university Graz, Austria"],"affiliations":[{"raw_affiliation_string":"Technical university Graz, Austria","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5027559065"],"corresponding_institution_ids":["https://openalex.org/I21250087"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.8387,"has_fulltext":false,"cited_by_count":191,"citation_normalized_percentile":{"value":0.7481169,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":97,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"254","last_page":"262"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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.9997000098228455,"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.9965000152587891,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.7257438898086548},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6550434231758118},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5457796454429626},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5331873893737793},{"id":"https://openalex.org/keywords/greedy-coloring","display_name":"Greedy coloring","score":0.47580891847610474},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4496800899505615},{"id":"https://openalex.org/keywords/characterization","display_name":"Characterization (materials science)","score":0.4390036165714264},{"id":"https://openalex.org/keywords/np-complete","display_name":"NP-complete","score":0.438279390335083},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.41489169001579285},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3427698016166687},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3021275997161865},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19593492150306702},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07412642240524292},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.07173797488212585},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.04229813814163208}],"concepts":[{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.7257438898086548},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6550434231758118},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5457796454429626},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5331873893737793},{"id":"https://openalex.org/C38767284","wikidata":"https://www.wikidata.org/wiki/Q5601715","display_name":"Greedy coloring","level":5,"score":0.47580891847610474},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4496800899505615},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.4390036165714264},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.438279390335083},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.41489169001579285},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3427698016166687},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3021275997161865},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19593492150306702},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07412642240524292},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.07173797488212585},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.04229813814163208},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/3-540-45477-2_23","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45477-2_23","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:pure.tue.nl:openaire_cris_publications/e1dff730-e339-4f5e-8d07-6b3c5f931d56","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/e1dff730-e339-4f5e-8d07-6b3c5f931d56","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":"Kr\u00e1l, D, Kratochvil, J, Tuza, Z & Woeginger, G J 2001, Complexity of coloring graphs without forbidden induced subgraphs. in A Brandst\u00e4dt & V B Le (eds), Graph-Theoretic Concepts in Computer Science (Proceedings 27th International Workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001). Lecture Notes in Computer Science, vol. 2204, Springer, Berlin, pp. 254-262. https://doi.org/10.1007/3-540-45477-2_23","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:ris.utwente.nl:openaire_cris_publications/e2c8d141-6346-4084-b8fc-1b4087f51f89","is_oa":false,"landing_page_url":"https://research.utwente.nl/en/publications/e2c8d141-6346-4084-b8fc-1b4087f51f89","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":"Kr\u00e1l, D, Kratochvil, J, Tuza, Z & Woeginger, G 2001, Complexity of coloring graphs without forbidden subgraphs. in A Brandst\u00e4dt & V B Le (eds), Graph-Theoretic Concepts in Computer Science : 27th InternationalWorkshop, WG 2001 Boltenhagen, Germany, June 14\u201316, 2001 Proceedings. Lecture Notes in Computer Science, vol. 2204, Springer, Berlin, pp. 254-262, 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2001, Boltenhagen, Germany, 14/06/01. https://doi.org/10.1007/3-540-45477-2_23","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:ris.utwente.nl:publications/e2c8d141-6346-4084-b8fc-1b4087f51f89","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:tue:oai:pure.tue.nl:publications/e1dff730-e339-4f5e-8d07-6b3c5f931d56","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/e1dff730-e339-4f5e-8d07-6b3c5f931d56","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Graph-Theoretic Concepts in Computer Science (Proceedings 27th International Workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001), 254 - 262","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W94262720","https://openalex.org/W163386900","https://openalex.org/W2054926952","https://openalex.org/W2066577300","https://openalex.org/W2068121436","https://openalex.org/W2102669784","https://openalex.org/W2161439427","https://openalex.org/W4229970255"],"related_works":["https://openalex.org/W183100298","https://openalex.org/W4291316360","https://openalex.org/W1542397451","https://openalex.org/W1170108254","https://openalex.org/W4390280037","https://openalex.org/W2793500002","https://openalex.org/W4298054421","https://openalex.org/W1965626709","https://openalex.org/W2780971292","https://openalex.org/W4297911588"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":17},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":20},{"year":2017,"cited_by_count":15},{"year":2016,"cited_by_count":10},{"year":2015,"cited_by_count":21},{"year":2014,"cited_by_count":14},{"year":2013,"cited_by_count":13},{"year":2012,"cited_by_count":15}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}