{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T21:14:23Z","timestamp":1774473263553,"version":"3.50.1"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/access.2026.3674987","type":"journal-article","created":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T20:24:47Z","timestamp":1773779087000},"page":"42366-42380","source":"Crossref","is-referenced-by-count":0,"title":["On Paired 2-Disjoint Path Coverability of Johnson and Generalized Johnson Graphs"],"prefix":"10.1109","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1052-5746","authenticated-orcid":false,"given":"Jung-Heum","family":"Park","sequence":"first","affiliation":[{"name":"School of Computer Science and Information Engineering, The Catholic University of Korea, Bucheon, Gyeonggi, Republic of Korea"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2008.160"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2020.03.010"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-022-04768-x"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-009-9292-5"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1979.234213"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2006.37"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2023.113401"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2023.02.002"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-020-03512-7"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2024.129270"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2025.114410"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1142\/s0129054121500301"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-024-06736-z"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2022.02.003"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2024.3445283"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2024.104887"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2020.09.008"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3226687"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054122500241"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-024-06572-1"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2024.129098"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2023.128262"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2024.129197"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.114327"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2024.05.036"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2017.08.022"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2024.113985"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2024.01.041"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/090765596"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1506"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.26493\/1855-3974.291.574"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.5817\/CZ.MUNI.EUROCOMB23-101"},{"issue":"2127","key":"ref33","first-page":"70","article-title":"Hamilton connected graphs","volume":"42","author":"Ore","year":"1963","journal-title":"J. Math. Pures Appl."},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2015.10.021"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20578"},{"key":"ref36","first-page":"110","article-title":"Fault hamiltonicity of two-dimensional torus networks","volume-title":"Proc. Workshop Algorithms Comput.","author":"Kim"},{"issue":"1","key":"ref37","first-page":"42","article-title":"Many-to-many disjoint path covers in two-dimensional tori","volume":"38","author":"Park","year":"2009","journal-title":"J. KIISE, Comput. Syst. Theory"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2016.09.020"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/11323511\/11435960.pdf?arnumber=11435960","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T19:57:38Z","timestamp":1774468658000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11435960\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/access.2026.3674987","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}