{"id":"https://openalex.org/W2054963334","doi":"https://doi.org/10.1016/s0304-3975(96)00220-4","title":"On extended P4-reducible and extended P4-sparse graphs","display_name":"On extended P4-reducible and extended P4-sparse graphs","publication_year":1997,"publication_date":"1997-06-01","ids":{"openalex":"https://openalex.org/W2054963334","doi":"https://doi.org/10.1016/s0304-3975(96)00220-4","mag":"2054963334"},"language":"en","primary_location":{"id":"doi:10.1016/s0304-3975(96)00220-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(96)00220-4","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"type":"article","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/A5073726725","display_name":"Vassilis Giakoumakis","orcid":"https://orcid.org/0000-0002-2194-2342"},"institutions":[{"id":"https://openalex.org/I4647051","display_name":"Universit\u00e9 de Picardie Jules Verne","ror":"https://ror.org/01gyxrk03","country_code":"FR","type":"education","lineage":["https://openalex.org/I4647051"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Vassilis Giakoumakis","raw_affiliation_strings":["La.R.I.A. Universit\u00e9 de Picardie Jules Verne (C.U.R.I.), 5 rue du Moulin Neuf 80000 Amiens, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"La.R.I.A. Universit\u00e9 de Picardie Jules Verne (C.U.R.I.), 5 rue du Moulin Neuf 80000 Amiens, France","institution_ids":["https://openalex.org/I4647051"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084003710","display_name":"Jean-Marie Vanherpe","orcid":null},"institutions":[{"id":"https://openalex.org/I4647051","display_name":"Universit\u00e9 de Picardie Jules Verne","ror":"https://ror.org/01gyxrk03","country_code":"FR","type":"education","lineage":["https://openalex.org/I4647051"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Jean-Marie Vanherpe","raw_affiliation_strings":["La.R.I.A. Universit\u00e9 de Picardie Jules Verne (C.U.R.I.), 5 rue du Moulin Neuf 80000 Amiens, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"La.R.I.A. Universit\u00e9 de Picardie Jules Verne (C.U.R.I.), 5 rue du Moulin Neuf 80000 Amiens, France","institution_ids":["https://openalex.org/I4647051"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5073726725"],"corresponding_institution_ids":["https://openalex.org/I4647051"],"apc_list":{"value":2600,"currency":"USD","value_usd":2600},"apc_paid":null,"fwci":2.0382,"has_fulltext":false,"cited_by_count":39,"citation_normalized_percentile":{"value":0.86439124,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"180","issue":"1-2","first_page":"269","last_page":"286"},"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.9987000226974487,"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.9980999827384949,"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.6443734765052795},{"id":"https://openalex.org/keywords/modular-decomposition","display_name":"Modular decomposition","score":0.623725175857544},{"id":"https://openalex.org/keywords/sparse-approximation","display_name":"Sparse approximation","score":0.5231653451919556},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.5178828239440918},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5139138698577881},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.5047215223312378},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.4911164939403534},{"id":"https://openalex.org/keywords/dense-graph","display_name":"Dense graph","score":0.47390997409820557},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.4675504267215729},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4644676744937897},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.4193423390388489},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3725716471672058},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3593160808086395},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3564258813858032},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.30325847864151},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2683521509170532},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.26418614387512207}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6443734765052795},{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.623725175857544},{"id":"https://openalex.org/C124066611","wikidata":"https://www.wikidata.org/wiki/Q28684319","display_name":"Sparse approximation","level":2,"score":0.5231653451919556},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.5178828239440918},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5139138698577881},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.5047215223312378},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.4911164939403534},{"id":"https://openalex.org/C13251829","wikidata":"https://www.wikidata.org/wiki/Q3085841","display_name":"Dense graph","level":5,"score":0.47390997409820557},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.4675504267215729},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4644676744937897},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.4193423390388489},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3725716471672058},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3593160808086395},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3564258813858032},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.30325847864151},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2683521509170532},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.26418614387512207}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s0304-3975(96)00220-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(96)00220-4","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-00467644v1","is_oa":false,"landing_page_url":"https://hal.science/hal-00467644","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Theoretical Computer Science, 1997, 180, pp.269-286","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4699999988079071,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W22831093","https://openalex.org/W59383121","https://openalex.org/W606008011","https://openalex.org/W1484040084","https://openalex.org/W1576293797","https://openalex.org/W1655990431","https://openalex.org/W1964604240","https://openalex.org/W1985562179","https://openalex.org/W2000763343","https://openalex.org/W2011039300","https://openalex.org/W2014488291","https://openalex.org/W2015906942","https://openalex.org/W2038893115","https://openalex.org/W2071801594","https://openalex.org/W2082068582","https://openalex.org/W2082242399","https://openalex.org/W2087405099","https://openalex.org/W2143474538","https://openalex.org/W4254743406","https://openalex.org/W4299866835","https://openalex.org/W6634597943"],"related_works":["https://openalex.org/W4226049246","https://openalex.org/W3175659217","https://openalex.org/W2031276298","https://openalex.org/W3130332934","https://openalex.org/W1919313975","https://openalex.org/W2061237693","https://openalex.org/W4293578199","https://openalex.org/W3083738242","https://openalex.org/W2362011785","https://openalex.org/W1583936408"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}