{"id":"https://openalex.org/W2040555446","doi":"https://doi.org/10.1002/(sici)1097-0118(199601)21:1<55::aid-jgt8>3.0.co;2-l","title":"Minimal non-neighborhood-perfect graphs","display_name":"Minimal non-neighborhood-perfect graphs","publication_year":1996,"publication_date":"1996-01-01","ids":{"openalex":"https://openalex.org/W2040555446","doi":"https://doi.org/10.1002/(sici)1097-0118(199601)21:1<55::aid-jgt8>3.0.co;2-l","mag":"2040555446"},"language":"en","primary_location":{"id":"doi:10.1002/(sici)1097-0118(199601)21:1<55::aid-jgt8>3.0.co;2-l","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0118(199601)21:1<55::aid-jgt8>3.0.co;2-l","pdf_url":null,"source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Theory","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":null,"display_name":"Andr\ufffds Gy\ufffdrf\ufffds","orcid":null},"institutions":[{"id":"https://openalex.org/I4210117195","display_name":"HUN-REN Institute for Computer Science and Control","ror":"https://ror.org/0249v7n71","country_code":"HU","type":"facility","lineage":["https://openalex.org/I4210117195","https://openalex.org/I4387152226"]},{"id":"https://openalex.org/I7597260","display_name":"Hungarian Academy of Sciences","ror":"https://ror.org/02ks8qq67","country_code":"HU","type":"government","lineage":["https://openalex.org/I7597260"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Andr\ufffds Gy\ufffdrf\ufffds","raw_affiliation_strings":["Computer and Automation Research Institute, Hungarian Academy of Sciences, XI, Kende U. 13\u201317, Budapest, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer and Automation Research Institute, Hungarian Academy of Sciences, XI, Kende U. 13\u201317, Budapest, Hungary","institution_ids":["https://openalex.org/I4210117195","https://openalex.org/I7597260"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109894460","display_name":"Dieter Kratsch","orcid":null},"institutions":[{"id":"https://openalex.org/I193291145","display_name":"Schiller International University","ror":"https://ror.org/003tmp461","country_code":"FR","type":"education","lineage":["https://openalex.org/I193291145"]},{"id":"https://openalex.org/I76198965","display_name":"Friedrich Schiller University Jena","ror":"https://ror.org/05qpz1x62","country_code":"DE","type":"education","lineage":["https://openalex.org/I76198965"]}],"countries":["DE","FR"],"is_corresponding":false,"raw_author_name":"Dieter Kratsch","raw_affiliation_strings":["Fakultat Mathematik, Friedrich-Schiller-Universitat, Universitatshochhaus, 0-6900, Jena, Germany","Fakultat Mathematik, Friedrich\u2010Schiller\u2010Universitat, Universitatshochhaus, 0\u20106900, Jena, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Fakultat Mathematik, Friedrich-Schiller-Universitat, Universitatshochhaus, 0-6900, Jena, Germany","institution_ids":["https://openalex.org/I76198965"]},{"raw_affiliation_string":"Fakultat Mathematik, Friedrich\u2010Schiller\u2010Universitat, Universitatshochhaus, 0\u20106900, Jena, Germany","institution_ids":["https://openalex.org/I193291145"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109985389","display_name":"Jen\u0151 Lehel","orcid":null},"institutions":[{"id":"https://openalex.org/I4210117195","display_name":"HUN-REN Institute for Computer Science and Control","ror":"https://ror.org/0249v7n71","country_code":"HU","type":"facility","lineage":["https://openalex.org/I4210117195","https://openalex.org/I4387152226"]},{"id":"https://openalex.org/I7597260","display_name":"Hungarian Academy of Sciences","ror":"https://ror.org/02ks8qq67","country_code":"HU","type":"government","lineage":["https://openalex.org/I7597260"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Jen\ufffd Lehel","raw_affiliation_strings":["Computer and Automation Research Institute, Hungarian Academy of Sciences, XI, Kende U. 13\u201317, Budapest, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer and Automation Research Institute, Hungarian Academy of Sciences, XI, Kende U. 13\u201317, Budapest, Hungary","institution_ids":["https://openalex.org/I4210117195","https://openalex.org/I7597260"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064579274","display_name":"Fr\u00e9d\u00e9ric Maffray","orcid":"https://orcid.org/0000-0002-8265-0415"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Frederic Maffray","raw_affiliation_strings":["CNRS, LSD-IMAG BP53X, 38041 Grenoble Cedex, France","CNRS, LSD\u2010IMAG BP53X, 38041 Grenoble Cedex, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CNRS, LSD-IMAG BP53X, 38041 Grenoble Cedex, France","institution_ids":["https://openalex.org/I1294671590"]},{"raw_affiliation_string":"CNRS, LSD\u2010IMAG BP53X, 38041 Grenoble Cedex, France","institution_ids":["https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":3760,"currency":"USD","value_usd":3760},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.17105396,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"21","issue":"1","first_page":"55","last_page":"66"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9973000288009644,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9968000054359436,"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/strong-perfect-graph-theorem","display_name":"Strong perfect graph theorem","score":0.8977375030517578},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8316076993942261},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8229249119758606},{"id":"https://openalex.org/keywords/trivially-perfect-graph","display_name":"Trivially perfect graph","score":0.7735306024551392},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.6814725995063782},{"id":"https://openalex.org/keywords/perfect-graph-theorem","display_name":"Perfect graph theorem","score":0.6587961912155151},{"id":"https://openalex.org/keywords/perfect-graph","display_name":"Perfect graph","score":0.6556556224822998},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.6155695915222168},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.558092474937439},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.5530932545661926},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5223230719566345},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.507717490196228},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.4349225163459778},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.4230022132396698},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.3415820598602295},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.336908221244812},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.29592669010162354}],"concepts":[{"id":"https://openalex.org/C51044901","wikidata":"https://www.wikidata.org/wiki/Q16680059","display_name":"Strong perfect graph theorem","level":5,"score":0.8977375030517578},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8316076993942261},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8229249119758606},{"id":"https://openalex.org/C170903109","wikidata":"https://www.wikidata.org/wiki/Q7844666","display_name":"Trivially perfect graph","level":5,"score":0.7735306024551392},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.6814725995063782},{"id":"https://openalex.org/C161487630","wikidata":"https://www.wikidata.org/wiki/Q2800071","display_name":"Perfect graph theorem","level":5,"score":0.6587961912155151},{"id":"https://openalex.org/C32972407","wikidata":"https://www.wikidata.org/wiki/Q1187620","display_name":"Perfect graph","level":5,"score":0.6556556224822998},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.6155695915222168},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.558092474937439},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.5530932545661926},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5223230719566345},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.507717490196228},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.4349225163459778},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.4230022132396698},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.3415820598602295},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.336908221244812},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.29592669010162354}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/(sici)1097-0118(199601)21:1<55::aid-jgt8>3.0.co;2-l","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0118(199601)21:1<55::aid-jgt8>3.0.co;2-l","pdf_url":null,"source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.699999988079071,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1985573889","https://openalex.org/W2006942360","https://openalex.org/W2019034047","https://openalex.org/W2143327390"],"related_works":["https://openalex.org/W2105838663","https://openalex.org/W3153161399","https://openalex.org/W2006942360","https://openalex.org/W1555810828","https://openalex.org/W2914244779","https://openalex.org/W2047104722","https://openalex.org/W199404365","https://openalex.org/W2040555446","https://openalex.org/W2085422823","https://openalex.org/W2029890572"],"abstract_inverted_index":{"Neighborhood-perfect":[0],"graphs":[1,8,36,41,71,77],"form":[2],"a":[3,79],"subclass":[4],"of":[5,15,34,47,69,75],"the":[6,10,32,52,61],"perfect":[7],"if":[9],"Strong":[11],"Perfect":[12],"Graph":[13],"Conjecture":[14],"C.":[16],"Berge":[17],"is":[18],"true.":[19],"However,":[20],"they":[21],"are":[22,60,72],"still":[23],"not":[24],"shown":[25],"to":[26],"be":[27],"perfect.":[28],"Here":[29],"we":[30,49],"propose":[31],"characterization":[33],"neighborhood-perfect":[35,70],"by":[37],"studying":[38],"minimal":[39],"non-neighborhood-perfect":[40],"(MNNPG).":[42],"After":[43],"presenting":[44],"some":[45],"properties":[46],"MNNPGs,":[48],"show":[50],"that":[51],"only":[53],"MNNPGs":[54],"with":[55],"neighborhood":[56],"independence":[57],"number":[58],"one":[59],"3-sun":[62],"and":[63,78],"3K2.":[64],"Also":[65],"two":[66],"further":[67],"classes":[68],"presented:":[73],"line-graphs":[74],"bipartite":[76],"3K2-free":[80],"cographs.":[81],"\u00a9":[82],"1996":[83],"John":[84],"Wiley":[85],"&":[86],"Sons,":[87],"Inc.":[88]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2016-06-24T00:00:00"}
