{"id":"https://openalex.org/W91714901","doi":"https://doi.org/10.1016/s0012-365x(00)00427-1","title":"On minimal cutsets in P5-free minimal imperfect graphs","display_name":"On minimal cutsets in P5-free minimal imperfect graphs","publication_year":2001,"publication_date":"2001-06-01","ids":{"openalex":"https://openalex.org/W91714901","doi":"https://doi.org/10.1016/s0012-365x(00)00427-1","mag":"91714901"},"language":"en","primary_location":{"id":"doi:10.1016/s0012-365x(00)00427-1","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0012-365x(00)00427-1","pdf_url":null,"source":{"id":"https://openalex.org/S18902827","display_name":"Discrete Mathematics","issn_l":"0012-365X","issn":["0012-365X","1872-681X"],"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":"Discrete Mathematics","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/A5084665597","display_name":"Vincent Barr\u00e9","orcid":null},"institutions":[{"id":"https://openalex.org/I4210087782","display_name":"Laval Mayenne Technopole","ror":"https://ror.org/002mr7c38","country_code":"FR","type":"nonprofit","lineage":["https://openalex.org/I4210087782"]},{"id":"https://openalex.org/I4210108471","display_name":"Le Mans Universit\u00e9","ror":"https://ror.org/01mtcc283","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210108471"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Vincent Barr\u00e9","raw_affiliation_strings":["D\u00e9partement Services et R\u00e9seaux de Communication, IUT de Laval, Universit\u00e9 du Maine, 53020 Laval Cedex 9, France"],"affiliations":[{"raw_affiliation_string":"D\u00e9partement Services et R\u00e9seaux de Communication, IUT de Laval, Universit\u00e9 du Maine, 53020 Laval Cedex 9, France","institution_ids":["https://openalex.org/I4210087782","https://openalex.org/I4210108471"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110003079","display_name":"Jean\u2010Luc Fouquet","orcid":null},"institutions":[{"id":"https://openalex.org/I4210108471","display_name":"Le Mans Universit\u00e9","ror":"https://ror.org/01mtcc283","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210108471"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Jean-Luc Fouquet","raw_affiliation_strings":["D\u00e9partement Mesures Physiques, IUT du Mans, Universit\u00e9 du Maine, 72085 Le Mans Cedex 9, France"],"affiliations":[{"raw_affiliation_string":"D\u00e9partement Mesures Physiques, IUT du Mans, Universit\u00e9 du Maine, 72085 Le Mans Cedex 9, France","institution_ids":["https://openalex.org/I4210108471"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5084665597"],"corresponding_institution_ids":["https://openalex.org/I4210087782","https://openalex.org/I4210108471"],"apc_list":{"value":3000,"currency":"USD","value_usd":3000},"apc_paid":null,"fwci":0.914,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.72164721,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"236","issue":"1-3","first_page":"25","last_page":"36"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9977999925613403,"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.9977999925613403,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9448000192642212,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T13991","display_name":"Nuclear Receptors and Signaling","score":0.9352999925613403,"subfield":{"id":"https://openalex.org/subfields/2804","display_name":"Cellular and Molecular Neuroscience"},"field":{"id":"https://openalex.org/fields/28","display_name":"Neuroscience"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.763190507888794},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.743109941482544},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6745879054069519},{"id":"https://openalex.org/keywords/distance-hereditary-graph","display_name":"Distance-hereditary graph","score":0.6057898998260498},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.602630615234375},{"id":"https://openalex.org/keywords/imperfect","display_name":"Imperfect","score":0.5675672888755798},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5611788630485535},{"id":"https://openalex.org/keywords/induced-path","display_name":"Induced path","score":0.4890349805355072},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46592187881469727},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46193042397499084},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.4521576762199402},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.2921101450920105},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.25595542788505554},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.17499148845672607},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.15136808156967163},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.11849096417427063},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.08727511763572693},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.05821430683135986}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.763190507888794},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.743109941482544},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6745879054069519},{"id":"https://openalex.org/C147792647","wikidata":"https://www.wikidata.org/wiki/Q5282847","display_name":"Distance-hereditary graph","level":5,"score":0.6057898998260498},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.602630615234375},{"id":"https://openalex.org/C2780310539","wikidata":"https://www.wikidata.org/wiki/Q12547192","display_name":"Imperfect","level":2,"score":0.5675672888755798},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5611788630485535},{"id":"https://openalex.org/C58228413","wikidata":"https://www.wikidata.org/wiki/Q15704639","display_name":"Induced path","level":5,"score":0.4890349805355072},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46592187881469727},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46193042397499084},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.4521576762199402},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.2921101450920105},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.25595542788505554},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.17499148845672607},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.15136808156967163},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.11849096417427063},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.08727511763572693},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.05821430683135986},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1016/s0012-365x(00)00427-1","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0012-365x(00)00427-1","pdf_url":null,"source":{"id":"https://openalex.org/S18902827","display_name":"Discrete Mathematics","issn_l":"0012-365X","issn":["0012-365X","1872-681X"],"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":"Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.48.5270","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.5270","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.univ-lemans.fr/~barre/articles/cutset.ps.gz","raw_type":"text"},{"id":"pmh:oai:HAL:hal-02084789v1","is_oa":false,"landing_page_url":"https://hal.science/hal-02084789","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":"Discrete Mathematics, 2001, 236 (1-3), pp.25-36. &#x27E8;10.1016/S0012-365X(00)00427-1&#x27E9;","raw_type":"Journal articles"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2951872093","https://openalex.org/W2606500388","https://openalex.org/W4302323912","https://openalex.org/W3126911753","https://openalex.org/W1930073757","https://openalex.org/W2032950096","https://openalex.org/W91714901","https://openalex.org/W1708800690","https://openalex.org/W2604168044","https://openalex.org/W996937398"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}
