{"id":"https://openalex.org/W1983111560","doi":"https://doi.org/10.1002/jgt.3190160605","title":"Edge\u2010disjoint paths and cycles in <i>n</i>\u2010edge\u2010connected graphs","display_name":"Edge\u2010disjoint paths and cycles in <i>n</i>\u2010edge\u2010connected graphs","publication_year":1992,"publication_date":"1992-12-01","ids":{"openalex":"https://openalex.org/W1983111560","doi":"https://doi.org/10.1002/jgt.3190160605","mag":"1983111560"},"language":"en","primary_location":{"id":"doi:10.1002/jgt.3190160605","is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.3190160605","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/A5040833061","display_name":"Andreas Huck","orcid":null},"institutions":[{"id":"https://openalex.org/I114112103","display_name":"Leibniz University Hannover","ror":"https://ror.org/0304hq317","country_code":"DE","type":"education","lineage":["https://openalex.org/I114112103"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Andreas Huck","raw_affiliation_strings":["Institut Fu\u0308r Mathematik Universita\u0301t Hannover Welfengarten 1 W-3000 Hannover 1 Federal Republic of Germany","Institut F\u00fcr Mathematik Universit\u00e1t Hannover Welfengarten 1 W\u20103000 Hannover 1 Federal Republic of Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut Fu\u0308r Mathematik Universita\u0301t Hannover Welfengarten 1 W-3000 Hannover 1 Federal Republic of Germany","institution_ids":["https://openalex.org/I114112103"]},{"raw_affiliation_string":"Institut F\u00fcr Mathematik Universit\u00e1t Hannover Welfengarten 1 W\u20103000 Hannover 1 Federal Republic of Germany","institution_ids":["https://openalex.org/I114112103"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5040833061"],"corresponding_institution_ids":["https://openalex.org/I114112103"],"apc_list":{"value":3760,"currency":"USD","value_usd":3760},"apc_paid":null,"fwci":0.4802,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.60057471,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"16","issue":"6","first_page":"571","last_page":"589"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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.9997000098228455,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.996399998664856,"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.9050925970077515},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8046965599060059},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5271365642547607},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5219768285751343},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5033027529716492},{"id":"https://openalex.org/keywords/connectivity","display_name":"Connectivity","score":0.43507063388824463},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4330507516860962},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.42377376556396484},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4215669631958008},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.41770148277282715},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.059768617153167725}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.9050925970077515},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8046965599060059},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5271365642547607},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5219768285751343},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5033027529716492},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.43507063388824463},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4330507516860962},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.42377376556396484},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4215669631958008},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.41770148277282715},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.059768617153167725},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/jgt.3190160605","is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.3190160605","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1618113945","https://openalex.org/W1786780942","https://openalex.org/W2036576672","https://openalex.org/W2045928065","https://openalex.org/W2059563583","https://openalex.org/W2087038119","https://openalex.org/W2091662889"],"related_works":["https://openalex.org/W1983615627","https://openalex.org/W76348209","https://openalex.org/W2075939699","https://openalex.org/W1586160618","https://openalex.org/W349944016","https://openalex.org/W2898189817","https://openalex.org/W1967416454","https://openalex.org/W2357631959","https://openalex.org/W2047609543","https://openalex.org/W4250859470"],"abstract_inverted_index":{"Abstract":[0],"We":[1,142],"consider":[2],"finite":[3],"undirected":[4],"loopless":[5],"graphs":[6],"G":[7,33,55,77,94,117],"in":[8,93,116],"which":[9],"multiple":[10],"edges":[11,75],"are":[12,52,72,139],"possible.":[13],"For":[14],"integers":[15],"k,l":[16],"\u2265":[17,26],"0":[18,27],"let":[19],"g(k,":[20],"l)":[21],"be":[22],"the":[23,29],"minimal":[24],"n":[25,36],"with":[28],"following":[30],"property:":[31],"If":[32],"is":[34],"an":[35],"\u2010edge\u2010connected":[37],"graph,":[38],"s":[39,43,97],"1":[40,47,59,66,127,134],",":[41,45,48,56,60,64,67,71,78,95,128,132,135],"\u20db,":[42,49,61,68,85,108,129,136],"k":[44,51,86,131],"t":[46,50,100],"vertices":[53],"of":[54,76],"and":[57,99,102,121,145],"f":[58,62,119],"l":[63,70,109,138,152],"g":[65,69,122,149],"pairwise":[73,140],"distinct":[74],"then":[79],"for":[80,103,148],"each":[81,104],"i":[82,92,98,101,105,115,120,123],"=":[83,106],"1,":[84,107],"there":[87,110],"exists":[88,111],"a":[89,112],"path":[90],"P":[91,126,130],"connecting":[96],"cycle":[113],"C":[114,133,137],"containing":[118],"such":[124],"that":[125],"edge\u2010disjoint.":[141],"give":[143],"upper":[144],"lower":[146],"bounds":[147],"(":[150],"k,":[151],").":[153]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}