{"id":"https://openalex.org/W4403104534","doi":"https://doi.org/10.1007/s10623-024-01493-9","title":"Transitive path decompositions of Cartesian products of complete graphs","display_name":"Transitive path decompositions of Cartesian products of complete graphs","publication_year":2024,"publication_date":"2024-10-03","ids":{"openalex":"https://openalex.org/W4403104534","doi":"https://doi.org/10.1007/s10623-024-01493-9"},"language":"en","primary_location":{"id":"doi:10.1007/s10623-024-01493-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10623-024-01493-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10623-024-01493-9.pdf","source":{"id":"https://openalex.org/S81616010","display_name":"Designs Codes and Cryptography","issn_l":"0925-1022","issn":["0925-1022","1573-7586"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Designs, Codes and Cryptography","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10623-024-01493-9.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5029283350","display_name":"Ajani De Vas Gunasekara","orcid":"https://orcid.org/0000-0002-2404-0344"},"institutions":[{"id":"https://openalex.org/I93396115","display_name":"The University of Notre Dame Australia","ror":"https://ror.org/02stey378","country_code":"AU","type":"education","lineage":["https://openalex.org/I93396115"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Ajani De Vas Gunasekara","raw_affiliation_strings":["School of Arts and Sciences, The University of Notre Dame Australia, 140 Broadway, Sydney, NSW, 2007, Australia"],"raw_orcid":"https://orcid.org/0000-0002-2404-0344","affiliations":[{"raw_affiliation_string":"School of Arts and Sciences, The University of Notre Dame Australia, 140 Broadway, Sydney, NSW, 2007, Australia","institution_ids":["https://openalex.org/I93396115"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026094792","display_name":"Alice Devillers","orcid":"https://orcid.org/0000-0002-0766-4032"},"institutions":[{"id":"https://openalex.org/I177877127","display_name":"The University of Western Australia","ror":"https://ror.org/047272k79","country_code":"AU","type":"education","lineage":["https://openalex.org/I177877127"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Alice Devillers","raw_affiliation_strings":["Centre for the Mathematics of Symmetry and Computation, School of Physics, Mathematics and Computing, The University of Western Australia, Crawley, WA, 6009, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Centre for the Mathematics of Symmetry and Computation, School of Physics, Mathematics and Computing, The University of Western Australia, Crawley, WA, 6009, Australia","institution_ids":["https://openalex.org/I177877127"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5029283350"],"corresponding_institution_ids":["https://openalex.org/I93396115"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.13797439,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"92","issue":"12","first_page":"4231","last_page":"4245"},"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.9994000196456909,"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.9994000196456909,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9965999722480774,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9965000152587891,"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/mathematics","display_name":"Mathematics","score":0.8901205062866211},{"id":"https://openalex.org/keywords/cartesian-product","display_name":"Cartesian product","score":0.8225858807563782},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.6932981610298157},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.594919741153717},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4913558065891266},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46131086349487305},{"id":"https://openalex.org/keywords/cartesian-coordinate-system","display_name":"Cartesian coordinate system","score":0.4285440146923065},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09509161114692688},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.08678990602493286}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8901205062866211},{"id":"https://openalex.org/C65236422","wikidata":"https://www.wikidata.org/wiki/Q173740","display_name":"Cartesian product","level":2,"score":0.8225858807563782},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.6932981610298157},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.594919741153717},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4913558065891266},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46131086349487305},{"id":"https://openalex.org/C16038011","wikidata":"https://www.wikidata.org/wiki/Q62912","display_name":"Cartesian coordinate system","level":2,"score":0.4285440146923065},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09509161114692688},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.08678990602493286},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s10623-024-01493-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10623-024-01493-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10623-024-01493-9.pdf","source":{"id":"https://openalex.org/S81616010","display_name":"Designs Codes and Cryptography","issn_l":"0925-1022","issn":["0925-1022","1573-7586"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Designs, Codes and Cryptography","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:openaire/ff3ebe03-c077-4a09-8f30-8f13d5fb26db","is_oa":true,"landing_page_url":"https://admin.research-repository.uwa.edu.au/en/publications/ff3ebe03-c077-4a09-8f30-8f13d5fb26db","pdf_url":null,"source":{"id":"https://openalex.org/S4306402523","display_name":"UWA Profiles and Research Repository (University of Western Australia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177877127","host_organization_name":"The University of Western Australia","host_organization_lineage":["https://openalex.org/I177877127"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"De Vas Gunasekara, A & Devillers, A 2024, 'Transitive path decompositions of Cartesian products of complete graphs', Designs, Codes, and Cryptography, vol. 92, no. 12, pp. 4231-4245. https://doi.org/10.1007/s10623-024-01493-9","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.atira.dk:publications/ff3ebe03-c077-4a09-8f30-8f13d5fb26db","is_oa":true,"landing_page_url":"https://research-repository.uwa.edu.au/en/publications/ff3ebe03-c077-4a09-8f30-8f13d5fb26db","pdf_url":null,"source":{"id":"https://openalex.org/S4306402523","display_name":"UWA Profiles and Research Repository (University of Western Australia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177877127","host_organization_name":"The University of Western Australia","host_organization_lineage":["https://openalex.org/I177877127"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"De Vas Gunasekara, A & Devillers, A 2024, 'Transitive path decompositions of Cartesian products of complete graphs', Designs, Codes, and Cryptography, vol. 92, no. 12, pp. 4231-4245. https://doi.org/10.1007/s10623-024-01493-9","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:researchonline.nd.edu.au:arts_article-1200","is_oa":false,"landing_page_url":"https://researchonline.nd.edu.au/arts_article/194","pdf_url":null,"source":{"id":"https://openalex.org/S4306400898","display_name":"ResearchOnline@ND (The University of Notre Dame)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I107639228","host_organization_name":"University of Notre Dame","host_organization_lineage":["https://openalex.org/I107639228"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Arts Papers and Journal Articles","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s10623-024-01493-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10623-024-01493-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10623-024-01493-9.pdf","source":{"id":"https://openalex.org/S81616010","display_name":"Designs Codes and Cryptography","issn_l":"0925-1022","issn":["0925-1022","1573-7586"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Designs, Codes and Cryptography","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4403104534.pdf"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W1504067189","https://openalex.org/W1584586959","https://openalex.org/W1732406929","https://openalex.org/W1983162902","https://openalex.org/W1989116585","https://openalex.org/W2018718538","https://openalex.org/W2052783499","https://openalex.org/W2054375542","https://openalex.org/W2056587530","https://openalex.org/W2157741071","https://openalex.org/W2964306182","https://openalex.org/W3094689971","https://openalex.org/W4317433886","https://openalex.org/W6965091864"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W4312527695","https://openalex.org/W2361167282","https://openalex.org/W1528932152","https://openalex.org/W2091342995","https://openalex.org/W2271118953","https://openalex.org/W3007067598","https://openalex.org/W2359420171","https://openalex.org/W3030274415","https://openalex.org/W68628300"],"abstract_inverted_index":{"Abstract":[0],"An":[1],"H":[2,24,34,48,72,95],"-decomposition":[3,35],"of":[4,16,33,47,58,60,74,127,140],"a":[5,14,30,56,97,107,110],"graph":[6,76],"$$\\Gamma":[7,61],"$$":[8,62],"<mml:math":[9,63,80],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[10,64,81],"<mml:mi>\u0393</mml:mi>":[11,65],"</mml:math>":[12,66,93],"is":[13,29,37,96,101],"partition":[15],"its":[17],"edge":[18],"set":[19],"into":[20],"subgraphs":[21,45],"isomorphic":[22],"to":[23,124],".":[25,67],"A":[26],"transitive":[27,71,111],"decomposition":[28,113,119],"special":[31],"kind":[32],"that":[36,43],"highly":[38],"symmetrical":[39],"in":[40,117],"the":[41,44,75,115,118,125],"sense":[42],"(copies":[46],")":[49],"are":[50,120],"preserved":[51],"and":[52,136],"transitively":[53],"permuted":[54],"by":[55],"group":[57],"automorphisms":[59],"This":[68],"paper":[69],"concerns":[70],"-decompositions":[73],"$$K_n":[77],"\\Box":[78],"K_n$$":[79],"<mml:mrow>":[82],"<mml:msub>":[83,88],"<mml:mi>K</mml:mi>":[84,89],"<mml:mi>n</mml:mi>":[85,90],"</mml:msub>":[86,91],"<mml:mo>\u25a1</mml:mo>":[87],"</mml:mrow>":[92],"where":[94,114],"path.":[98],"When":[99],"n":[100],"an":[102,137],"odd":[103],"prime,":[104],"we":[105],"present":[106],"construction":[108],"for":[109],"path":[112],"paths":[116],"considerably":[121],"large":[122],"compared":[123],"number":[126],"vertices.":[128],"Our":[129],"main":[130],"result":[131],"supports":[132],"well-known":[133],"Gallai\u2019s":[134],"conjecture":[135],"extended":[138],"version":[139],"Ringel\u2019s":[141],"conjecture.":[142]},"counts_by_year":[],"updated_date":"2026-06-13T06:13:01.061226","created_date":"2025-10-10T00:00:00"}