{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T22:16:47Z","timestamp":1770502607616,"version":"3.49.0"},"reference-count":12,"publisher":"World Scientific Pub Co Pte Ltd","issue":"02","funder":[{"name":"the Major Research Project of Shanxi Province","award":["202202020101006"],"award-info":[{"award-number":["202202020101006"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12371356"],"award-info":[{"award-number":["12371356"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Inter. Net."],"published-print":{"date-parts":[[2026,6]]},"abstract":"<jats:p>Finding a cycle that contains certain prescribed vertices or edges within a graph is a classical problem in graph theory. It has been established that every [Formula: see text]-connected cubic graph contains a cycle through any nine vertices, which is referred to as the well-known nine-point theorem. In this paper, it is demonstrated that every [Formula: see text]-connected cubic graph contains a cycle through any four prescribed vertices and a [Formula: see text]-path. This result is optimal.<\/jats:p>","DOI":"10.1142\/s0219265925500057","type":"journal-article","created":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T06:53:46Z","timestamp":1741157626000},"source":"Crossref","is-referenced-by-count":0,"title":["A Note on Cycles Containing 4 Vertices and 2-Path in 3-Connected Cubic Graphs"],"prefix":"10.1142","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-1714-8094","authenticated-orcid":false,"given":"Yashu","family":"Li","sequence":"first","affiliation":[{"name":"Department of Mathematics, Taiyuan University of Technology, Taiyuan 030024, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7584-6877","authenticated-orcid":false,"given":"Xia","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Taiyuan University of Technology, Taiyuan 030024, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3827-7334","authenticated-orcid":false,"given":"Weihua","family":"Yang","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Taiyuan University of Technology, Taiyuan 030024, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2025,3,5]]},"reference":[{"key":"S0219265925500057BIB001","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2"},{"key":"S0219265925500057BIB002","doi-asserted-by":"publisher","DOI":"10.1002\/mana.19600220107"},{"key":"S0219265925500057BIB003","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.10011"},{"key":"S0219265925500057BIB004","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579281"},{"key":"S0219265925500057BIB005","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190150407"},{"key":"S0219265925500057BIB006","first-page":"21","volume":"26","author":"Bau S.","year":"1988","journal-title":"Ars Combinat"},{"key":"S0219265925500057BIB007","doi-asserted-by":"publisher","DOI":"10.1007\/BF01788553"},{"key":"S0219265925500057BIB008","first-page":"82","volume":"4","author":"Lov\u00e1sz L.","year":"1974","journal-title":"Period. Math. Hungar."},{"key":"S0219265925500057BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(77)90072-7"},{"key":"S0219265925500057BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(95)00079-C"},{"key":"S0219265925500057BIB011","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2023.113468"},{"key":"S0219265925500057BIB012","volume-title":"Computer investigation of cubic graphs","author":"Bussemaker F.C.","year":"1976"}],"container-title":["Journal of Interconnection Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219265925500057","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T01:40:07Z","timestamp":1770342007000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0219265925500057"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,5]]},"references-count":12,"journal-issue":{"issue":"02","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["10.1142\/S0219265925500057"],"URL":"https:\/\/doi.org\/10.1142\/s0219265925500057","relation":{},"ISSN":["0219-2659","1793-6713"],"issn-type":[{"value":"0219-2659","type":"print"},{"value":"1793-6713","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,5]]},"article-number":"2550005"}}