{"id":"https://openalex.org/W2112406764","doi":"https://doi.org/10.1137/0405009","title":"Disjoint Paths in a Planar Graph\u2014A General Theorem","display_name":"Disjoint Paths in a Planar Graph\u2014A General Theorem","publication_year":1992,"publication_date":"1992-02-01","ids":{"openalex":"https://openalex.org/W2112406764","doi":"https://doi.org/10.1137/0405009","mag":"2112406764"},"language":"en","primary_location":{"id":"doi:10.1137/0405009","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0405009","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on 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/A5108454863","display_name":"Guoli Ding","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Guoli Ding","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028190074","display_name":"Alexander Schrijver","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"A. Schrijver","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5031948088","display_name":"Paul Seymour","orcid":"https://orcid.org/0000-0003-0067-4534"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"P. D. Seymour","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.913,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.86744522,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"5","issue":"1","first_page":"112","last_page":"116"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9811999797821045,"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.9811999797821045,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9603999853134155,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.8662323951721191},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8145936727523804},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.690626323223114},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5842065215110779},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.525423526763916},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5160884261131287},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5097879767417908},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4407609701156616},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.06132614612579346}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8662323951721191},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8145936727523804},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.690626323223114},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5842065215110779},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.525423526763916},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5160884261131287},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5097879767417908},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4407609701156616},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.06132614612579346},{"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.1137/0405009","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0405009","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","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":1,"referenced_works":["https://openalex.org/W1982584550"],"related_works":["https://openalex.org/W4295995756","https://openalex.org/W2400746548","https://openalex.org/W2057787145","https://openalex.org/W4287756435","https://openalex.org/W2066770505","https://openalex.org/W3164898278","https://openalex.org/W2951456395","https://openalex.org/W2365230865","https://openalex.org/W4280629867","https://openalex.org/W1997341083"],"abstract_inverted_index":{"Let":[0],"$D":[1],"=":[2,83],"(":[3,18],"V,A":[4],")$":[5,21,80],"be":[6,22,39,46],"a":[7,47,68],"directed":[8,69],"planar":[9],"graph,":[10],"let":[11,33,44],"$(":[12,78],"r_1":[13],",s_1":[14],"),":[15],"\\cdots":[16,36,55,85],",":[17,35],"r_k":[19],",s_k":[20],"pairs":[23,51],"of":[24,29,41,49,67],"vertices":[25],"on":[26],"the":[27,30,65],"boundary":[28],"unbounded":[31],"face,":[32],"$A_1":[34],",A_k":[37],"$":[38,73,76,90,93],"subsets":[40],"A,":[42],"and":[43,61,91],"H":[45],"collection":[48],"unordered":[50],"from":[52],"$\\{":[53,97],"1,":[54,84],",k":[56],"\\}$.":[57],"Given":[58],"are":[59,94],"necessary":[60],"sufficient":[62],"conditions":[63],"for":[64],"existence":[66],"$r_i":[70],"-":[71],"s_i":[72],"path":[74],"$P_i":[75,89],"in":[77],"V,A_i":[79],"(for":[81],"$i":[82],",k$),":[86],"such":[87],"that":[88],"$P_j":[92],"vertex-disjoint":[95],"whenever":[96],"i,":[98],"j":[99],"\\}":[100],"\\in":[101],"H$.":[102]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}