{"id":"https://openalex.org/W2018732791","doi":"https://doi.org/10.1017/s0963548302005461","title":"Packing Digraphs with Directed Closed Trails","display_name":"Packing Digraphs with Directed Closed Trails","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W2018732791","doi":"https://doi.org/10.1017/s0963548302005461","mag":"2018732791"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548302005461","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548302005461","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","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/A5003243157","display_name":"Paul Balister","orcid":"https://orcid.org/0000-0003-2696-0352"},"institutions":[{"id":"https://openalex.org/I94658018","display_name":"University of Memphis","ror":"https://ror.org/01cq23130","country_code":"US","type":"education","lineage":["https://openalex.org/I94658018"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"PAUL BALISTER","raw_affiliation_strings":["Department of Mathematical Sciences, University of Memphis, Memphis, TN 38152-3240","Department of Mathematical Sciences, University of Memphis, Memphis, TN 38152-3240, USA balistep@msci.memphis.edu"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, University of Memphis, Memphis, TN 38152-3240","institution_ids":["https://openalex.org/I94658018"]},{"raw_affiliation_string":"Department of Mathematical Sciences, University of Memphis, Memphis, TN 38152-3240, USA balistep@msci.memphis.edu","institution_ids":["https://openalex.org/I94658018"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5003243157"],"corresponding_institution_ids":["https://openalex.org/I94658018"],"apc_list":null,"apc_paid":null,"fwci":2.434,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":{"value":0.88594854,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"12","issue":"1","first_page":"1","last_page":"15"},"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.9998999834060669,"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.9998999834060669,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9994999766349792,"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.9993000030517578,"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/eulerian-path","display_name":"Eulerian path","score":0.8685348033905029},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8301252722740173},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.7046970129013062},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.6529568433761597},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6190701127052307},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5430073738098145},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5356321930885315},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47258460521698},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.415549099445343},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.19863933324813843},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.0810721218585968},{"id":"https://openalex.org/keywords/lagrangian","display_name":"Lagrangian","score":0.05802881717681885},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.04891318082809448}],"concepts":[{"id":"https://openalex.org/C43058520","wikidata":"https://www.wikidata.org/wiki/Q624580","display_name":"Eulerian path","level":3,"score":0.8685348033905029},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8301252722740173},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7046970129013062},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.6529568433761597},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6190701127052307},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5430073738098145},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5356321930885315},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47258460521698},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.415549099445343},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.19863933324813843},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0810721218585968},{"id":"https://openalex.org/C53469067","wikidata":"https://www.wikidata.org/wiki/Q505735","display_name":"Lagrangian","level":2,"score":0.05802881717681885},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.04891318082809448}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0963548302005461","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548302005461","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","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":4,"referenced_works":["https://openalex.org/W1504418244","https://openalex.org/W2043912076","https://openalex.org/W2113571905","https://openalex.org/W3197714832"],"related_works":["https://openalex.org/W1608193","https://openalex.org/W55260560","https://openalex.org/W4291236902","https://openalex.org/W2301956807","https://openalex.org/W203749057","https://openalex.org/W2018732791","https://openalex.org/W2043128958","https://openalex.org/W1493358325","https://openalex.org/W2075073335","https://openalex.org/W3196191381"],"abstract_inverted_index":{"It":[0],"has":[1],"been":[2],"shown":[3],"[2]":[4],"that":[5,65,108],"if":[6],"n":[7],"is":[8],"odd":[9],"and":[10,17,89,102,120],"m1,\u2026,mt":[11,85],"are":[12],"integers":[13],"with":[14],"mi[ges":[15,87],"]3":[16],"[sum":[18],"]i=1tmi=|E(Kn)|":[19],"then":[20],"Kn":[21],"can":[22,72,113],"be":[23,73,114],"decomposed":[24,74,115],"as":[25,75],"an":[26,76],"edge-disjoint":[27,77],"union":[28,78],"of":[29,32,50,79,83],"closed":[30,81],"trails":[31,82],"lengths":[33,84],"m1,\u2026,mt.":[34],"This":[35],"result":[36],"was":[37],"later":[38],"generalized":[39],"[3]":[40],"to":[41],"all":[42,103],"sufficiently":[43,109],"dense":[44,110],"Eulerian":[45,111],"graphs":[46],"G":[47],"in":[48,116],"place":[49],"Kn.":[51],"In":[52],"this":[53],"article":[54],"we":[55,121],"consider":[56],"the":[57,66,97],"corresponding":[58,123],"questions":[59],"for":[60,96,125],"directed":[61,68,80],"graphs.":[62],"We":[63,105],"show":[64,107],"complete":[67,127],"graph":[69],"<?TeX":[70,90],"\\displaystyle{\\mathop{K}^{\\raise-2pt\\hbox{}}}_{n}?>":[71],"whenever":[86],"]2":[88],"\\sum_{i=1}^t":[91],"m_{i}=\\vert":[92],"E({\\leftrightarrow}_{n})\\vert":[93],"?>,":[94],"except":[95],"single":[98],"case":[99],"when":[100],"n=6":[101],"mi=3.":[104],"also":[106],"digraphs":[112],"a":[117],"similar":[118],"manner,":[119],"prove":[122],"results":[124],"(undirected)":[126],"multigraphs.":[128]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}