{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T06:36:30Z","timestamp":1725690990001},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642315756"},{"type":"electronic","value":"9783642315763"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31576-3_71","type":"book-chapter","created":{"date-parts":[[2012,7,6]],"date-time":"2012-07-06T15:24:28Z","timestamp":1341588268000},"page":"561-568","source":"Crossref","is-referenced-by-count":0,"title":["Distance Coloring and Distance Edge-Coloring of d- dimensional Lattice"],"prefix":"10.1007","author":[{"given":"Shuang-Liang","family":"Tian","sequence":"first","affiliation":[]},{"given":"Ping","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-2","key":"71_CR1","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0012-365X(89)90163-5","volume":"78","author":"R.J. Faudree","year":"1989","unstructured":"Faudree, R.J., Gy\u00e1rf\u00e1s, A., Schelp, R.H., Tuza, Z.: Induced Matchings in Bipartite Graphs. Discrete Math.\u00a078(1-2), 83\u201387 (1989)","journal-title":"Discrete Math."},{"key":"71_CR2","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0020-0190(03)00232-1","volume":"87","author":"G. Fertin","year":"2003","unstructured":"Fertin, G., Godard, E., Raspaud, A.: Acyclic and k-distance Coloring of the Grid. Information Processing Letters\u00a087, 51\u201358 (2003)","journal-title":"Information Processing Letters"},{"key":"71_CR3","first-page":"141","volume":"109","author":"J.P. Georges","year":"1995","unstructured":"Georges, J.P., Mauro, D.M.: Generalized Vertex Labelings with A Condition at Distance Two. Congr. Numer.\u00a0109, 141\u2013159 (1995)","journal-title":"Congr. Numer."},{"key":"71_CR4","doi-asserted-by":"publisher","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","volume":"68","author":"W.K. Hale","year":"1980","unstructured":"Hale, W.K.: Frequency Assignment: Theory and Applications. Proceedings IEEE\u00a068, 1497\u20131514 (1980)","journal-title":"Proceedings IEEE"},{"key":"71_CR5","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1002\/jgt.10077","volume":"42","author":"J. Heuvel","year":"2003","unstructured":"Heuvel, J., McGuinness, S.: Coloring the Square of A Planar Graph. J. Graph Theory\u00a042, 110\u2013124 (2003)","journal-title":"J. Graph Theory"},{"key":"71_CR6","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1016\/j.jda.2006.03.020","volume":"5","author":"T. Ito","year":"2007","unstructured":"Ito, T., Kato, A., Zhou, X., Nishizeki, T.: Algorithms for Finding Distance Edge-colorings of Graphs. J. Discrete Algorithms\u00a05, 304\u2013322 (2007)","journal-title":"J. Discrete Algorithms"},{"key":"71_CR7","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0012-365X(00)00440-4","volume":"236","author":"S. Jendrol","year":"2001","unstructured":"Jendrol, S., Skupie\u0144, Z.: Local Structures in Plane Maps and Distance Colorings. Discrete Math.\u00a0236, 167\u2013177 (2001)","journal-title":"Discrete Math."},{"key":"71_CR8","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/S0166-218X(99)00249-8","volume":"103","author":"D.S. Kim","year":"2000","unstructured":"Kim, D.S., Du, D.Z., Pardalos, P.M.: A Coloring Problem On The n-cube. Discrete Applied Math.\u00a0103, 307\u2013311 (2000)","journal-title":"Discrete Applied Math."},{"key":"71_CR9","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1016\/j.disc.2006.11.059","volume":"308","author":"F. Kramer","year":"2008","unstructured":"Kramer, F., Kramer, H.: A survey on The Distance-colouring of Graphs. Discrete Math.\u00a0308, 422\u2013426 (2008)","journal-title":"Discrete Math."},{"key":"71_CR10","first-page":"11","volume":"48","author":"D. Marx","year":"2004","unstructured":"Marx, D.: Graph Coloring Problems and Their Applications in Scheduling. Periodica Polytechnica-Electrical Engineering\u00a048, 11\u201316 (2004)","journal-title":"Periodica Polytechnica-Electrical Engineering"},{"issue":"2","key":"71_CR11","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1006\/jctb.1997.1724","volume":"69","author":"M. Molloy","year":"1997","unstructured":"Molloy, M., Reed, B.: A Bound on The Strong Chromatic Index of a Graph. J. Combin. Theory Ser. B\u00a069(2), 103\u2013109 (1997)","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Lecture Notes in Computer Science","Intelligent Computing Theories and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31576-3_71.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:13:16Z","timestamp":1620130396000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31576-3_71"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642315756","9783642315763"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31576-3_71","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}