{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T01:44:01Z","timestamp":1755222241107,"version":"3.43.0"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032002808","type":"print"},{"value":"9783032002815","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,8,11]],"date-time":"2025-08-11T00:00:00Z","timestamp":1754870400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,11]],"date-time":"2025-08-11T00:00:00Z","timestamp":1754870400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-00281-5_14","type":"book-chapter","created":{"date-parts":[[2025,8,10]],"date-time":"2025-08-10T11:38:22Z","timestamp":1754825902000},"page":"219-227","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Edge-Intersection Graph of\u00a0Induced Paths in\u00a0a\u00a0Graph"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6036-5835","authenticated-orcid":false,"given":"Severino V.","family":"Gervacio","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,11]]},"reference":[{"key":"14_CR1","unstructured":"Balakrishnan, R.: Triangle graphs. In: Graph Connections (Cochin, 1998), p.\u00a044, Allied Publications, New Delhi (1999)"},{"key":"14_CR2","first-page":"465","volume":"36","author":"Y Egawa","year":"1991","unstructured":"Egawa, Y., Ramos, R.E.: Triangle graphs. Math. Japon. 36, 465\u2013467 (1991)","journal-title":"Math. Japon."},{"key":"14_CR3","first-page":"97","volume":"32","author":"Y Egawa","year":"1991","unstructured":"Egawa, Y., Kano, M., Tan, E.L.: On cycle graphs. Ars Combin. 32, 97\u2013113 (1991)","journal-title":"Ars Combin."},{"key":"14_CR4","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BFb0073127","volume-title":"Graph Theory Singapore 1983","author":"SV Gervacio","year":"1984","unstructured":"Gervacio, S.V.: Cycle graphs. In: Koh, K.M., Yap, H.P. (eds.) Graph Theory Singapore 1983. LNM, vol. 1073, pp. 279\u2013293. Springer, Heidelberg (1984). https:\/\/doi.org\/10.1007\/BFb0073127"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Harary, F.: Graph Theory. Addison-Wesley, Reading Mass (1969)","DOI":"10.21236\/AD0705364"},{"key":"14_CR6","unstructured":"Krausz, J.: D\u00e9monstration nouvelle d\u2019un th\u00e9oreme de Whitney sur les r\u00e9seaux. Mat. Fiz. Lapok 50, 75\u201385 (1943)"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Pullman, N.: Clique covering of graphs. IV. Algorithms. SIAM J. Comput. 13, 57\u201375 (1984)","DOI":"10.1137\/0213005"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"van Rooij, A.C.M.,\u00a0Wilf, H.S.: The interchange graph of a finite graph. Acta Math. Hungarica 16(3\u20134), 263\u2013269 (1965). https:\/\/doi.org\/10.1007\/BF01904834","DOI":"10.1007\/BF01904834"},{"key":"14_CR9","doi-asserted-by":"publisher","unstructured":"Varghese, S., Gervacio, S.V., Vijayakumar, A.: On cycle graphs. Asian-Eur. J. Math. 16(3) (2023). https:\/\/doi.org\/10.1142\/S1793557123500365","DOI":"10.1142\/S1793557123500365"}],"container-title":["Lecture Notes in Computer Science","Discrete and Computational Geometry, Graphs, and Games"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-00281-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,10]],"date-time":"2025-08-10T12:02:39Z","timestamp":1754827359000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-00281-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,11]]},"ISBN":["9783032002808","9783032002815"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-00281-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,11]]},"assertion":[{"value":"11 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"JCDCGGG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japanese Conference on Discrete and Computational Geometry, Graphs, and Games","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"jcdcg2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.alg.cei.uec.ac.jp\/itohiro\/JCDCGG\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}