{"id":"https://openalex.org/W2052867211","doi":"https://doi.org/10.1016/0020-0190(92)90234-m","title":"The vertex separation number of a graph equals its path-width","display_name":"The vertex separation number of a graph equals its path-width","publication_year":1992,"publication_date":"1992-07-01","ids":{"openalex":"https://openalex.org/W2052867211","doi":"https://doi.org/10.1016/0020-0190(92)90234-m","mag":"2052867211"},"language":"en","primary_location":{"id":"doi:10.1016/0020-0190(92)90234-m","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(92)90234-m","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"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":"Information Processing Letters","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/A5012060355","display_name":"Nancy Kinnersley","orcid":null},"institutions":[{"id":"https://openalex.org/I146416000","display_name":"University of Kansas","ror":"https://ror.org/001tmjg57","country_code":"US","type":"education","lineage":["https://openalex.org/I146416000"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Nancy G. Kinnersley","raw_affiliation_strings":["Department of Computer Science, University of Kansas, Lawrence, KS 66045, USA","Department of Computer Science,  University of Kansas, Lawrence, KS 66045, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Kansas, Lawrence, KS 66045, USA","institution_ids":["https://openalex.org/I146416000"]},{"raw_affiliation_string":"Department of Computer Science,  University of Kansas, Lawrence, KS 66045, USA","institution_ids":["https://openalex.org/I146416000"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5012060355"],"corresponding_institution_ids":["https://openalex.org/I146416000"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":0.4797,"has_fulltext":false,"cited_by_count":212,"citation_normalized_percentile":{"value":0.6416185,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"42","issue":"6","first_page":"345","last_page":"350"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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.9993000030517578,"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/T12288","display_name":"Optimization and Search Problems","score":0.9977999925613403,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6025065779685974},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6001810431480408},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5972264409065247},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.46805092692375183},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44540444016456604},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4192710518836975},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3605979084968567},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2901984453201294}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6025065779685974},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6001810431480408},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5972264409065247},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.46805092692375183},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44540444016456604},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4192710518836975},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3605979084968567},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2901984453201294},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0020-0190(92)90234-m","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(92)90234-m","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"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":"Information Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6000000238418579,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W153433887","https://openalex.org/W604158355","https://openalex.org/W1987092466","https://openalex.org/W1996419691","https://openalex.org/W1998007106","https://openalex.org/W1999061527","https://openalex.org/W2000611521","https://openalex.org/W2015469394","https://openalex.org/W2042534515","https://openalex.org/W2063019820","https://openalex.org/W2137766675","https://openalex.org/W2162494152","https://openalex.org/W2476613922","https://openalex.org/W2509889156","https://openalex.org/W2991385428","https://openalex.org/W6606205372","https://openalex.org/W6649746529","https://openalex.org/W6650205432","https://openalex.org/W6680400994","https://openalex.org/W6725240325","https://openalex.org/W6770833062"],"related_works":["https://openalex.org/W2980963558","https://openalex.org/W1882246857","https://openalex.org/W3103304230","https://openalex.org/W2185360082","https://openalex.org/W1992365905","https://openalex.org/W4287664878","https://openalex.org/W3212023493","https://openalex.org/W1991411408","https://openalex.org/W2066456778","https://openalex.org/W4288278856"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":10},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":14},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":13},{"year":2012,"cited_by_count":12}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}