{"id":"https://openalex.org/W2045928065","doi":"https://doi.org/10.1016/0095-8956(84)90069-8","title":"Paths and edge-connectivity in graphs","display_name":"Paths and edge-connectivity in graphs","publication_year":1984,"publication_date":"1984-10-01","ids":{"openalex":"https://openalex.org/W2045928065","doi":"https://doi.org/10.1016/0095-8956(84)90069-8","mag":"2045928065"},"language":"en","primary_location":{"id":"doi:10.1016/0095-8956(84)90069-8","is_oa":true,"landing_page_url":"https://doi.org/10.1016/0095-8956(84)90069-8","pdf_url":"https://www.sciencedirect.com/science/article/pii/0095895684900698/pdf","source":{"id":"https://openalex.org/S2939117604","display_name":"Journal of Combinatorial Theory Series B","issn_l":"0095-8956","issn":["0095-8956","1096-0902"],"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":"Journal of Combinatorial Theory, Series B","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.sciencedirect.com/science/article/pii/0095895684900698/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5005153069","display_name":"Haruko Okamura","orcid":null},"institutions":[{"id":"https://openalex.org/I317356780","display_name":"Osaka City University","ror":"https://ror.org/02skfsw40","country_code":"JP","type":"education","lineage":["https://openalex.org/I317356780"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Haruko Okamura","raw_affiliation_strings":["Faculty of Engineering, Osaka City University, Osaka 558, Japan","Faculty of Engineering, Osaka City University, Osaka, 558, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Engineering, Osaka City University, Osaka 558, Japan","institution_ids":["https://openalex.org/I317356780"]},{"raw_affiliation_string":"Faculty of Engineering, Osaka City University, Osaka, 558, Japan","institution_ids":["https://openalex.org/I317356780"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5005153069"],"corresponding_institution_ids":["https://openalex.org/I317356780"],"apc_list":{"value":3110,"currency":"USD","value_usd":3110},"apc_paid":null,"fwci":1.039,"has_fulltext":true,"cited_by_count":29,"citation_normalized_percentile":{"value":0.76094137,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"37","issue":"2","first_page":"151","last_page":"172"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9997000098228455,"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/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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7864311337471008},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.6446966528892517},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6004471778869629},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.599091649055481},{"id":"https://openalex.org/keywords/induced-path","display_name":"Induced path","score":0.5861245393753052},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5825900435447693},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5066640973091125},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4867112934589386},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3733265995979309},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.27120649814605713},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2439967393875122},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.14979085326194763},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.058274805545806885},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.04906579852104187}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7864311337471008},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.6446966528892517},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6004471778869629},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.599091649055481},{"id":"https://openalex.org/C58228413","wikidata":"https://www.wikidata.org/wiki/Q15704639","display_name":"Induced path","level":5,"score":0.5861245393753052},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5825900435447693},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5066640973091125},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4867112934589386},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3733265995979309},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.27120649814605713},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2439967393875122},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.14979085326194763},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.058274805545806885},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.04906579852104187},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0095-8956(84)90069-8","is_oa":true,"landing_page_url":"https://doi.org/10.1016/0095-8956(84)90069-8","pdf_url":"https://www.sciencedirect.com/science/article/pii/0095895684900698/pdf","source":{"id":"https://openalex.org/S2939117604","display_name":"Journal of Combinatorial Theory Series B","issn_l":"0095-8956","issn":["0095-8956","1096-0902"],"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":"Journal of Combinatorial Theory, Series B","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/0095-8956(84)90069-8","is_oa":true,"landing_page_url":"https://doi.org/10.1016/0095-8956(84)90069-8","pdf_url":"https://www.sciencedirect.com/science/article/pii/0095895684900698/pdf","source":{"id":"https://openalex.org/S2939117604","display_name":"Journal of Combinatorial Theory Series B","issn_l":"0095-8956","issn":["0095-8956","1096-0902"],"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":"Journal of Combinatorial Theory, Series B","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2045928065.pdf","grobid_xml":"https://content.openalex.org/works/W2045928065.grobid-xml"},"referenced_works_count":11,"referenced_works":["https://openalex.org/W1531368347","https://openalex.org/W1618113945","https://openalex.org/W1786780942","https://openalex.org/W1968025656","https://openalex.org/W2026530148","https://openalex.org/W2059563583","https://openalex.org/W2060765530","https://openalex.org/W2091662889","https://openalex.org/W4210246355","https://openalex.org/W6642174380","https://openalex.org/W6657007199"],"related_works":["https://openalex.org/W1971174658","https://openalex.org/W2099195351","https://openalex.org/W4256429076","https://openalex.org/W2012063272","https://openalex.org/W2348092930","https://openalex.org/W3162204513","https://openalex.org/W2062850566","https://openalex.org/W2024994163","https://openalex.org/W2132921321","https://openalex.org/W3130401278"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":3}],"updated_date":"2026-07-31T08:31:51.225901","created_date":"2025-10-10T00:00:00"}