{"id":"https://openalex.org/W2068341861","doi":"https://doi.org/10.1002/jgt.3190110115","title":"Minimum path decompositions of oriented cubic graphs","display_name":"Minimum path decompositions of oriented cubic graphs","publication_year":1987,"publication_date":"1987-03-01","ids":{"openalex":"https://openalex.org/W2068341861","doi":"https://doi.org/10.1002/jgt.3190110115","mag":"2068341861"},"language":"en","primary_location":{"id":"doi:10.1002/jgt.3190110115","is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.3190110115","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/A5077335303","display_name":"K. B. Reid","orcid":"https://orcid.org/0000-0001-9205-0942"},"institutions":[{"id":"https://openalex.org/I121820613","display_name":"Louisiana State University","ror":"https://ror.org/05ect4e57","country_code":"US","type":"education","lineage":["https://openalex.org/I121820613"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K. B. Reid","raw_affiliation_strings":["Louisiana State University Baton Rouge, LA 70803","Louisiana State Univ.  Baton Rouge LA 70803"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Louisiana State University Baton Rouge, LA 70803","institution_ids":["https://openalex.org/I121820613"]},{"raw_affiliation_string":"Louisiana State Univ.  Baton Rouge LA 70803","institution_ids":["https://openalex.org/I121820613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010332258","display_name":"Keith Wayland","orcid":null},"institutions":[{"id":"https://openalex.org/I60388903","display_name":"University of Puerto Rico-Mayaguez","ror":"https://ror.org/00wek6x04","country_code":"PR","type":"education","lineage":["https://openalex.org/I200399037","https://openalex.org/I60388903"]}],"countries":["PR"],"is_corresponding":false,"raw_author_name":"Keith Wayland","raw_affiliation_strings":["University of Puerto Rico Mayaguez, PR 00708"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Puerto Rico Mayaguez, PR 00708","institution_ids":["https://openalex.org/I60388903"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":4150,"currency":"USD","value_usd":4150},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.21139971,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"11","issue":"1","first_page":"113","last_page":"118"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","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"}},"topics":[{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","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/T10374","display_name":"Advanced Graph Theory Research","score":0.9979000091552734,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8470124006271362},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8053234815597534},{"id":"https://openalex.org/keywords/cubic-graph","display_name":"Cubic graph","score":0.7110591530799866},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6464035511016846},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.6129331588745117},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47416773438453674},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.44449201226234436},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.4232128858566284},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4094541668891907},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.18193519115447998},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.07342284917831421},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.06553980708122253}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8470124006271362},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8053234815597534},{"id":"https://openalex.org/C100500283","wikidata":"https://www.wikidata.org/wiki/Q1374495","display_name":"Cubic graph","level":5,"score":0.7110591530799866},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6464035511016846},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.6129331588745117},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47416773438453674},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.44449201226234436},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.4232128858566284},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4094541668891907},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.18193519115447998},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.07342284917831421},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.06553980708122253},{"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/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/jgt.3190110115","is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.3190110115","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W1996277976","https://openalex.org/W1997073280","https://openalex.org/W2030429728"],"related_works":["https://openalex.org/W3194471551","https://openalex.org/W4375956809","https://openalex.org/W1581373162","https://openalex.org/W2039864950","https://openalex.org/W4288279572","https://openalex.org/W2784911598","https://openalex.org/W4297950433","https://openalex.org/W4287023968","https://openalex.org/W1973978937","https://openalex.org/W4286909116"],"abstract_inverted_index":{"Abstract":[0],"Pullman":[1],"[3]":[2],"conjectured":[3],"that":[4],"if":[5],"k":[6,21],"is":[7,31,58,71],"an":[8],"odd":[9],"positive":[10],"integer,":[11],"then":[12],"every":[13],"orientation":[14],"of":[15,19,36,46],"a":[16,23],"regular":[17],"graph":[18],"degree":[20],"has":[22],"minimum":[24],"decomposition":[25,41],"which":[26,30],"contains":[27],"no":[28],"vertex":[29,35,45],"both":[32],"the":[33,40,43,51,56],"initial":[34],"some":[37,47],"path":[38,49],"in":[39,50],"and":[42,63],"terminal":[44],"other":[48],"decomposition.":[52],"In":[53],"this":[54],"paper,":[55],"conjecture":[57,68],"established":[59],"for":[60,69],"cubic":[61],"graphs,":[62],"its":[64],"connection":[65],"with":[66],"Kelly's":[67],"tournaments":[70],"described.":[72]},"counts_by_year":[],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}