{"id":"https://openalex.org/W2094822380","doi":"https://doi.org/10.1016/0097-3165(85)90033-0","title":"Resolvable path designs","display_name":"Resolvable path designs","publication_year":1985,"publication_date":"1985-07-01","ids":{"openalex":"https://openalex.org/W2094822380","doi":"https://doi.org/10.1016/0097-3165(85)90033-0","mag":"2094822380"},"language":"en","primary_location":{"id":"doi:10.1016/0097-3165(85)90033-0","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0097-3165(85)90033-0","pdf_url":null,"source":{"id":"https://openalex.org/S128556326","display_name":"Journal of Combinatorial Theory Series A","issn_l":"0097-3165","issn":["0097-3165","1096-0899"],"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 A","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/A5084176957","display_name":"Joseph D. Horton","orcid":null},"institutions":[{"id":"https://openalex.org/I106938459","display_name":"University of New Brunswick","ror":"https://ror.org/05nkf0n29","country_code":"CA","type":"education","lineage":["https://openalex.org/I106938459"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"J.D Horton","raw_affiliation_strings":["School of Computer Science, University of New Brunswick, Fredericton, New Brunswick E3B 5A3, Canada"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, University of New Brunswick, Fredericton, New Brunswick E3B 5A3, Canada","institution_ids":["https://openalex.org/I106938459"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5084176957"],"corresponding_institution_ids":["https://openalex.org/I106938459"],"apc_list":{"value":3320,"currency":"USD","value_usd":3320},"apc_paid":null,"fwci":1.642,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.83989213,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"39","issue":"2","first_page":"117","last_page":"131"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9995999932289124,"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/T11798","display_name":"Optimal Experimental Design Methods","score":0.9857000112533569,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9824000000953674,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8525485396385193},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.8110669255256653},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7382417321205139},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5646862983703613},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5441634654998779},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5348637700080872},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.469632625579834},{"id":"https://openalex.org/keywords/path-graph","display_name":"Path graph","score":0.41714975237846375},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4099804759025574},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.17582422494888306},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.10158291459083557},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.07668054103851318}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8525485396385193},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.8110669255256653},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7382417321205139},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5646862983703613},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5441634654998779},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5348637700080872},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.469632625579834},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.41714975237846375},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4099804759025574},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.17582422494888306},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.10158291459083557},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.07668054103851318},{"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/0097-3165(85)90033-0","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0097-3165(85)90033-0","pdf_url":null,"source":{"id":"https://openalex.org/S128556326","display_name":"Journal of Combinatorial Theory Series A","issn_l":"0097-3165","issn":["0097-3165","1096-0899"],"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 A","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":7,"referenced_works":["https://openalex.org/W1980079420","https://openalex.org/W1983162902","https://openalex.org/W2018370870","https://openalex.org/W2044426324","https://openalex.org/W2052783499","https://openalex.org/W4212833901","https://openalex.org/W4248085145"],"related_works":["https://openalex.org/W2117548279","https://openalex.org/W2807449856","https://openalex.org/W238211858","https://openalex.org/W2070252991","https://openalex.org/W2941201715","https://openalex.org/W2025727968","https://openalex.org/W1971174658","https://openalex.org/W2803761277","https://openalex.org/W4297742300","https://openalex.org/W4295096867"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}