{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:35:59Z","timestamp":1743154559643,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319644189"},{"type":"electronic","value":"9783319644196"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-64419-6_54","type":"book-chapter","created":{"date-parts":[[2017,8,16]],"date-time":"2017-08-16T02:42:00Z","timestamp":1502851320000},"page":"425-434","source":"Crossref","is-referenced-by-count":0,"title":["$$P_{3}$$ P 3 -Factorization of Triangulated Cartesian Product of\u00a0Complete Graph of Odd Order"],"prefix":"10.1007","author":[{"given":"A.","family":"Tamil Elakkiya","sequence":"first","affiliation":[]},{"given":"A.","family":"Muthusamy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,17]]},"reference":[{"key":"54_CR1","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1016\/j.disc.2011.08.001","volume":"312","author":"S Afzal","year":"2012","unstructured":"Afzal, S., Brand, C.: Recognizing triangulated cartesian graph products. Discrete Math. 312, 188\u2013193 (2012)","journal-title":"Discrete Math."},{"key":"54_CR2","doi-asserted-by":"crossref","unstructured":"Alspach, B., Bermond, J.C., Sotteau, D.: Decomposition into cycles I: Hamilton decompositions. In: Hahn, G. et al. (ed.) Cycles and Rays, pp. 9\u201318. Kluwer Academic Publisher, Dordrecht (1990)","DOI":"10.1007\/978-94-009-0517-7_2"},{"key":"54_CR3","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198500292.001.0001","volume-title":"Combinatorial Designs and Tournaments","author":"I Anderson","year":"1997","unstructured":"Anderson, I.: Combinatorial Designs and Tournaments. Oxford University Press, Newyork (1997)"},{"key":"54_CR4","volume-title":"Incidence and Symmetry in Design and Architecture","author":"JA Baglivo","year":"1983","unstructured":"Baglivo, J.A., Graver, J.E.: Incidence and Symmetry in Design and Architecture. Cambridge University Press, New York (1983)"},{"key":"54_CR5","first-page":"60","volume":"63","author":"V Chitra","year":"2011","unstructured":"Chitra, V., Muthusamy, A.: $$P_{3}$$ P 3 -factorization of cartesian product of complete graphs. Bull. ICA 63, 60\u201372 (2011)","journal-title":"Bull. ICA"},{"key":"54_CR6","first-page":"115","volume":"141","author":"R Haggkvist","year":"1989","unstructured":"Haggkvist, R.: Decompositions of complete bipartite graphs. London Math. Soc. Lecture Note Ser. 141, 115\u2013147 (1989)","journal-title":"London Math. Soc. Lecture Note Ser."},{"key":"54_CR7","volume-title":"Design Theory","author":"CC Lindner","year":"2009","unstructured":"Lindner, C.C., Rodger, C.A.: Design Theory. Chapman & Hall\/CRC Press, Taylor & Francis Group, Boca Raton (2009)"},{"key":"54_CR8","unstructured":"Muthusamy, A., Paulraja, P.: Path factorization of product graphs. In: Proceedings of the National Workshop on Graph Theory and its Applications, pp. 77\u201388. Manonmaniam Sundaranar University, Tirunelveli (1996)"},{"key":"54_CR9","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0012-365X(98)00176-9","volume":"195","author":"A Muthusamy","year":"1999","unstructured":"Muthusamy, A., Paulraja, P.: Path factorizations of complete multipartite graphs. Discrete Math. 195, 181\u2013201 (1999)","journal-title":"Discrete Math."},{"key":"54_CR10","first-page":"127","volume":"84","author":"R Sampathkumar","year":"2013","unstructured":"Sampathkumar, R., Kandan, P.: $$P_{4}$$ P 4 -factorization of cartesian product of complete Graphs. J. Combin. Math. Combin. Comput. 84, 127\u2013135 (2013)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"54_CR11","doi-asserted-by":"crossref","unstructured":"Tamil Elakkiya, A., Muthusamy, A.: $$P_{5}$$ P 5 -factorization of cartesian product of graphs. Discrete Math. Algorithms Appl. 6(2), 19 p. (2014). 1450019","DOI":"10.1142\/S1793830914500190"},{"key":"54_CR12","doi-asserted-by":"crossref","unstructured":"Tamil Elakkiya, A., Muthusamy, A.: $$P_{3}$$ P 3 -factorization of triangulated cartesian product of complete graphs. Discrete Math. Algorithms Appl. 7(1), 28 p. (2015). 1450066","DOI":"10.1142\/S1793830914500669"},{"key":"54_CR13","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/0012-365X(88)90227-0","volume":"72","author":"K Ushio","year":"1988","unstructured":"Ushio, K.: $$P_{3}$$ P 3 -factorization of complete bipartite graphs. Discrete Math. 72, 361\u2013366 (1988)","journal-title":"Discrete Math."},{"key":"54_CR14","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0012-365X(93)90305-D","volume":"122","author":"ML Yu","year":"1993","unstructured":"Yu, M.L.: On path factorization of complete multipartite graphs. Discrete Math. 122, 325\u2013333 (1993)","journal-title":"Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science and Discrete Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-64419-6_54","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,26]],"date-time":"2024-06-26T08:45:28Z","timestamp":1719391528000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-64419-6_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319644189","9783319644196"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-64419-6_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}