{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T17:28:23Z","timestamp":1745947703338},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540369257"},{"type":"electronic","value":"9783540369264"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11809678_38","type":"book-chapter","created":{"date-parts":[[2006,8,15]],"date-time":"2006-08-15T09:41:33Z","timestamp":1155634893000},"page":"360-367","source":"Crossref","is-referenced-by-count":16,"title":["Optimal Acyclic Edge Colouring of Grid Like Graphs"],"prefix":"10.1007","author":[{"given":"Rahul","family":"Muthu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Narayanan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. R.","family":"Subramanian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"38_CR1","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1002\/rsa.3240020303","volume":"2","author":"N. Alon","year":"1991","unstructured":"Alon, N., McDiarmid, C.J.H., Reed, B.: Acyclic coloring of graphs. Random Structures and Algorithms\u00a02, 277\u2013288 (1991)","journal-title":"Random Structures and Algorithms"},{"key":"38_CR2","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1002\/jgt.1010","volume":"37","author":"N. Alon","year":"2001","unstructured":"Alon, N., Sudakov, B., Zaks, A.: Acyclic edge colorings of graphs. Journal of Graph Theory\u00a037, 157\u2013167 (2001)","journal-title":"Journal of Graph Theory"},{"key":"38_CR3","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/s00453-001-0093-8","volume":"32","author":"N. Alon","year":"2002","unstructured":"Alon, N., Zaks, A.: Algorithmic aspects of acyclic edge colorings. Algorithmica\u00a032, 611\u2013614 (2002)","journal-title":"Algorithmica"},{"key":"38_CR4","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/S0012-365X(00)00289-2","volume":"235","author":"D. Amar","year":"2001","unstructured":"Amar, D., Raspaud, A., Togni, O.: All to all wavelength routing in all-optical compounded networks. Discrete Mathematics 235, 353\u2013363 (2001)","journal-title":"Discrete Mathematics"},{"key":"38_CR5","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF01200428","volume":"2","author":"F. Aurenhammer","year":"1992","unstructured":"Aurenhammer, F., Hagauer, J., Imrich, W.: Cartesian graph factorization at logarithmic cost per edge. Computational Complexity\u00a02, 331\u2013349 (1992)","journal-title":"Computational Complexity"},{"key":"38_CR6","first-page":"21","volume":"93","author":"M.I. Burnstein","year":"1979","unstructured":"Burnstein, M.I.: Every 4-valent graph has an acyclic 5-coloring. Soobsc Akad. Nauk Grucin\u00a093, 21\u201324 (1979) (in Russian)","journal-title":"Soobsc Akad. Nauk Grucin"},{"key":"38_CR7","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/BF02764716","volume":"14","author":"B. Gr\u00fcnbaum","year":"1973","unstructured":"Gr\u00fcnbaum, B.: Acyclic colorings of planar graphs. Israel J. Math.\u00a014, 390\u2013408 (1973)","journal-title":"Israel J. Math."},{"key":"38_CR8","volume-title":"Product graphs : Structure and recognition","author":"W. Imrich","year":"2000","unstructured":"Imrich, W., Klavzar, S.: Product graphs: Structure and recognition. John Wiley & Sons Inc., Chichester (2000)"},{"issue":"4","key":"38_CR9","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1002\/(SICI)1097-0118(199704)24:4<331::AID-JGT5>3.0.CO;2-P","volume":"24","author":"A.V. Kostochka","year":"1997","unstructured":"Kostochka, A.V., Sopena, E., Zhu, X.: Acyclic and oriented chromatic numbers of graphs. J. Graph Theory\u00a024(4), 331\u2013340 (1997)","journal-title":"J. Graph Theory"},{"key":"38_CR10","doi-asserted-by":"crossref","unstructured":"Molloy, M., Reed, B.: Further algorithmic aspects of lovaz local lemma. In: 30th Annual ACM Symposium on Theorey of Computing, pp. 524\u2013529 (1998)","DOI":"10.1145\/276698.276866"},{"key":"38_CR11","unstructured":"Muthu, R., Narayanan, N., Subramanian, C.R.: Optimal acyclic edge colouring of grid like graphs. Full Manuscript, submitted to a journal (For a copy, email the authors)"},{"key":"38_CR12","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.endm.2005.05.024","volume":"19","author":"R. Muthu","year":"2005","unstructured":"Muthu, R., Narayanan, N., Subramanian, C.R.: Improved bounds on acyclic edge colouring. Electronic Notes in Discrete Mathematics\u00a019, 171\u2013177 (2005)","journal-title":"Electronic Notes in Discrete Mathematics"},{"issue":"1","key":"38_CR13","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1002\/jgt.20064","volume":"49","author":"J. Ne\u0161et\u0159il","year":"2005","unstructured":"Ne\u0161et\u0159il, J., Wormald, N.C.: The acyclic edge chromatic number of a random d-regular graph is d\u2009+\u20091. Journal of Graph Theory\u00a049(1), 69\u201374 (2005)","journal-title":"Journal of Graph Theory"},{"key":"38_CR14","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/BF01162967","volume":"72","author":"G. Sabidussi","year":"1960","unstructured":"Sabidussi, G.: Graph multiplication. Math. Z.\u00a072, 446\u2013457 (1960)","journal-title":"Math. Z."},{"key":"38_CR15","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.ipl.2004.08.002","volume":"92","author":"S. Skulrattanakulchai","year":"2004","unstructured":"Skulrattanakulchai, S.: Acyclic colorings of subcubic graphs. Information Processing Letters\u00a092, 161\u2013167 (2004)","journal-title":"Information Processing Letters"},{"key":"38_CR16","first-page":"30","volume":"9","author":"V.G. Vizing","year":"1963","unstructured":"Vizing, V.G.: The cartesian product of graphs (russian). Vycisl. Sistemy 9, 30\u201343 (1963); English translation in Comp. El. Syst. 2, 352\u2013365 (1966)","journal-title":"Vycisl. Sistemy"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11809678_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:13:44Z","timestamp":1605626024000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11809678_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540369257","9783540369264"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11809678_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}