{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,23]],"date-time":"2026-10-23T01:42:04Z","timestamp":1792719724495,"version":"4.5.0"},"reference-count":19,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100020595","name":"National Science and Technology Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100020595","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12471321"],"award-info":[{"award-number":["12471321"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12331013"],"award-info":[{"award-number":["12331013"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010002","name":"Ministry of Education","doi-asserted-by":"publisher","award":["2018R1D1A1B05048450"],"award-info":[{"award-number":["2018R1D1A1B05048450"]}],"id":[{"id":"10.13039\/100010002","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.ic.2026.105461","type":"journal-article","created":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T15:32:06Z","timestamp":1778340726000},"page":"105461","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Characterizing k-edge Hamiltonian connectedness for enhancing network structures"],"prefix":"10.1016","volume":"311","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5356-9060","authenticated-orcid":false,"given":"Huimei","family":"Guo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8714-8750","authenticated-orcid":false,"given":"Rong-Xia","family":"Hao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mei-Li","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9542-7968","authenticated-orcid":false,"given":"Jou-Ming","family":"Chang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1765-0806","authenticated-orcid":false,"given":"Young Soo","family":"Kwon","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.ic.2026.105461_bib0001","series-title":"Problem in Infinite and Finite Sets","volume":"10","author":"Plummer","year":"1975"},{"key":"10.1016\/j.ic.2026.105461_bib0002","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1006\/jctb.1994.1058","article-title":"4-connected projective-planar graphs are Hamiltonian","volume":"62","author":"Thomas","year":"1994","journal-title":"J. Comb. Theory B"},{"key":"10.1016\/j.ic.2026.105461_bib0003","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1002\/(SICI)1097-0118(199704)24:4<341::AID-JGT6>3.0.CO;2-O","article-title":"On paths in planar graphs","volume":"24","author":"Sanders","year":"1997","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.ic.2026.105461_bib0004","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1002\/jgt.20578","article-title":"Thomassen\u2019s conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs","volume":"69","author":"Ku\u017eel","year":"2012","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.ic.2026.105461_bib0005","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1016\/j.ejc.2013.06.033","article-title":"2-Edge-Hamiltonian-connectedness of 4-connected plane graphs","volume":"35","author":"Ozeki","year":"2014","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.ic.2026.105461_bib0006","doi-asserted-by":"crossref","DOI":"10.1016\/j.amc.2024.129197","article-title":"2-Edge Hamiltonian connectedness: characterization and results in data center networks","volume":"490","author":"Wang","year":"2025","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.ic.2026.105461_bib0007","doi-asserted-by":"crossref","DOI":"10.1016\/j.jpdc.2025.105095","article-title":"2-Edge-Hamilton-connected dragonfly network","volume":"202","author":"Guo","year":"2025","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/j.ic.2026.105461_bib0008","series-title":"Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks with Faulty Elements","volume":"17","author":"Park","year":"2006"},{"key":"10.1016\/j.ic.2026.105461_bib0009","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/j.dam.2020.09.008","article-title":"Torus-like graphs and their paired many-to-many disjoint path covers","volume":"289","author":"Park","year":"2021","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"10.1016\/j.ic.2026.105461_bib0010","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1109\/TC.2008.160","article-title":"Many-to-many disjoint path covers in the presence of faulty elements","volume":"58","author":"Park","year":"2009","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.ic.2026.105461_bib0011","doi-asserted-by":"crossref","DOI":"10.1016\/j.tcs.2023.114327","article-title":"Paired 2-disjoint path covers of burnt pancake graphs with faulty elements","volume":"986","author":"Dvo\u0159\u00e1k","year":"2024","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.ic.2026.105461_bib0012","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/s11227-024-06736-z","article-title":"Paired 2-disjoint path covers of balanced hypercube under the partitioned edge fault model","volume":"81","author":"Li","year":"2025","journal-title":"J. Supercomput."},{"key":"10.1016\/j.ic.2026.105461_bib0013","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/j.tcs.2022.02.003","article-title":"The unpaired many-to-many k-disjoint paths in bipartite hypercube-like networks","volume":"911","author":"Niu","year":"2022","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.ic.2026.105461_bib0014","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/j.tcs.2015.09.022","article-title":"An efficient algorithm to construct disjoint path covers of DCell networks","volume":"609","author":"Wang","year":"2016","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.ic.2026.105461_bib0015","doi-asserted-by":"crossref","DOI":"10.1016\/j.jpdc.2024.104887","article-title":"Paired 2-disjoint path covers of k-ary n-cubes under the partitioned edge fault model","volume":"190","author":"Zhuang","year":"2024","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/j.ic.2026.105461_bib0016","series-title":"Graph Theory","author":"Bondy","year":"2008"},{"issue":"2","key":"10.1016\/j.ic.2026.105461_bib0017","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1002\/net.10033","article-title":"Augmented cubes","volume":"40","author":"Choudum","year":"2002","journal-title":"Networks"},{"issue":"1","key":"10.1016\/j.ic.2026.105461_bib0018","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/j.parco.2004.10.002","article-title":"Fault hamiltonicity of augmented cubes","volume":"31","author":"Hsu","year":"2005","journal-title":"Parallel Comput."},{"issue":"10","key":"10.1016\/j.ic.2026.105461_bib0019","first-page":"1","article-title":"Two vertex-disjoint covering paths in augmented cube with faulty vertices","volume":"43","author":"She","year":"2023","journal-title":"J. Sci. Teach. Coll. Univ."}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540126000581?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540126000581?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,6]],"date-time":"2026-07-06T22:27:45Z","timestamp":1783376865000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0890540126000581"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":19,"alternative-id":["S0890540126000581"],"URL":"https:\/\/doi.org\/10.1016\/j.ic.2026.105461","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Characterizing k-edge Hamiltonian connectedness for enhancing network structures","name":"articletitle","label":"Article Title"},{"value":"Information and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ic.2026.105461","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"105461"}}