{"id":"https://openalex.org/W2149120814","doi":"https://doi.org/10.1002/jgt.3190140409","title":"A characterization of graphs without long induced paths","display_name":"A characterization of graphs without long induced paths","publication_year":1990,"publication_date":"1990-09-01","ids":{"openalex":"https://openalex.org/W2149120814","doi":"https://doi.org/10.1002/jgt.3190140409","mag":"2149120814"},"language":"en","primary_location":{"id":"doi:10.1002/jgt.3190140409","is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.3190140409","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":"https://openalex.org/A5017472275","display_name":"G\u00e1bor Bacs\u00f3","orcid":null},"institutions":[{"id":"https://openalex.org/I106118109","display_name":"E\u00f6tv\u00f6s Lor\u00e1nd University","ror":"https://ror.org/01jsq2704","country_code":"HU","type":"education","lineage":["https://openalex.org/I106118109"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"G\u00e1bor Bacs\u00f3","raw_affiliation_strings":["Department of Computer Science Eo\u0308tvo\u0308s University Budapest, Hungary","Department of Computer Science E\u00f6tv\u00f6s University Budapest, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science Eo\u0308tvo\u0308s University Budapest, Hungary","institution_ids":["https://openalex.org/I106118109"]},{"raw_affiliation_string":"Department of Computer Science E\u00f6tv\u00f6s University Budapest, Hungary","institution_ids":["https://openalex.org/I106118109"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026437192","display_name":"\u0179solt Tuza","orcid":"https://orcid.org/0000-0003-3235-9221"},"institutions":[{"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":"Zsolt Tuza","raw_affiliation_strings":["Computer and Automation Institute of the Hungarian Academy of Sciences, Budapest, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer and Automation Institute of the Hungarian Academy of Sciences, Budapest, Hungary","institution_ids":["https://openalex.org/I7597260"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":3760,"currency":"USD","value_usd":3760},"apc_paid":null,"fwci":0.989,"has_fulltext":false,"cited_by_count":43,"citation_normalized_percentile":{"value":0.77676538,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"14","issue":"4","first_page":"455","last_page":"464"},"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8729789853096008},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7240347266197205},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.6941953897476196},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6285425424575806},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5488307476043701},{"id":"https://openalex.org/keywords/distance-hereditary-graph","display_name":"Distance-hereditary graph","score":0.538190484046936},{"id":"https://openalex.org/keywords/induced-path","display_name":"Induced path","score":0.5127983689308167},{"id":"https://openalex.org/keywords/vertex-connectivity","display_name":"Vertex connectivity","score":0.4906059801578522},{"id":"https://openalex.org/keywords/path-graph","display_name":"Path graph","score":0.43401122093200684},{"id":"https://openalex.org/keywords/connectivity","display_name":"Connectivity","score":0.4302380681037903},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39495983719825745},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.26038652658462524},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.21001866459846497}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8729789853096008},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7240347266197205},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.6941953897476196},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6285425424575806},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5488307476043701},{"id":"https://openalex.org/C147792647","wikidata":"https://www.wikidata.org/wiki/Q5282847","display_name":"Distance-hereditary graph","level":5,"score":0.538190484046936},{"id":"https://openalex.org/C58228413","wikidata":"https://www.wikidata.org/wiki/Q15704639","display_name":"Induced path","level":5,"score":0.5127983689308167},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.4906059801578522},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.43401122093200684},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.4302380681037903},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39495983719825745},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.26038652658462524},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.21001866459846497}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/jgt.3190140409","is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.3190140409","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":2,"referenced_works":["https://openalex.org/W2030973065","https://openalex.org/W2136253510"],"related_works":["https://openalex.org/W1930073757","https://openalex.org/W4313325064","https://openalex.org/W2014594560","https://openalex.org/W1972252428","https://openalex.org/W1967687235","https://openalex.org/W1984251932","https://openalex.org/W91714901","https://openalex.org/W2349332978","https://openalex.org/W2149120814","https://openalex.org/W4250290902"],"abstract_inverted_index":{"Abstract":[0],"In":[1],"a":[2,26,40,54,64,76],"connected":[3,77,94,135,139],"graph":[4,55,78,136],"define":[5],"the":[6,9,99,121,125],"k\u2010center":[7],"as":[8,69],"set":[10,28],"of":[11,92,105],"vertices":[12,68],"whose":[13,44],"distance":[14,45],"from":[15,46],"any":[16,131],"other":[17],"vertex":[18,27,36],"is":[19,39,48,79,137],"at":[20,49,143],"most":[21,50,144],"k.":[22],"We":[23,73],"say":[24],"that":[25,75,120],"S":[29,43],"d":[30,51],"\u2010dominates":[31],"G":[32],"if":[33,59,87,90],"for":[34],"every":[35],"x":[37,47],"there":[38],"y":[41],"\u2208":[42],".":[52,116],"Call":[53],"P":[56,80,84,132],"t":[57,67,127,133,145],"\u2010free":[58,82,134],"it":[60],"does":[61],"not":[62],"contain":[63],"path":[65],"on":[66],"an":[70],"induced":[71,95,123],"subgraph.":[72],"prove":[74],"2k\u20101":[81],"(":[83,107,126],"2k":[85],"\u2010free)":[86],"and":[88,140],"only":[89],"each":[91],"its":[93],"subgraphs":[96],"H":[97,106,115],"satisfy":[98],"following":[100],"property:":[101],"The":[102],"k":[103,108,112],"\u2010center":[104],"\u2010":[109,113,128,146],"1)\u2010dominates":[110],"((":[111],"2)\u2010dominates)":[114],"Moreover,":[117],"we":[118],"show":[119],"subgraph":[122],"by":[124],"3)\u2010center":[129],"in":[130],"again":[138],"has":[141],"diameter":[142],"3.":[147]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}