{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,5]],"date-time":"2023-12-05T14:21:55Z","timestamp":1701786115377},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,1,21]],"date-time":"2011-01-21T00:00:00Z","timestamp":1295568000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1007\/s10878-011-9380-8","type":"journal-article","created":{"date-parts":[[2011,1,20]],"date-time":"2011-01-20T14:49:02Z","timestamp":1295534942000},"page":"266-279","source":"Crossref","is-referenced-by-count":7,"title":["On L(2,1)-labeling of generalized Petersen graphs"],"prefix":"10.1007","volume":"24","author":[{"given":"Yuan-Zhen","family":"Huang","sequence":"first","affiliation":[]},{"given":"Chun-Ying","family":"Chiang","sequence":"additional","affiliation":[]},{"given":"Liang-Hao","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Hong-Gwa","family":"Yeh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,1,21]]},"reference":[{"key":"9380_CR1","doi-asserted-by":"crossref","first-page":"1101","DOI":"10.1109\/TCSI.2005.862184","volume":"53","author":"SS Adams","year":"2006","unstructured":"Adams SS, Cass J, Troxell DS (2006) An extension of the channel-assignment problem: L(2,1)-labelings of generalized Petersen graphs. IEEE Trans Circuits Syst I, Fundam Theory Appl 53:1101\u20131107","journal-title":"IEEE Trans Circuits Syst I, Fundam Theory Appl"},{"key":"9380_CR2","doi-asserted-by":"crossref","first-page":"1314","DOI":"10.1016\/j.dam.2006.12.001","volume":"155","author":"SS Adams","year":"2007","unstructured":"Adams SS, Cass J, Tesch M, Troxell DS, Wheeland C (2007) The minimum span of L(2,1)-labelings of certain generalized Petersen graphs. Discrete Appl Math 155:1314\u20131325","journal-title":"Discrete Appl Math"},{"key":"9380_CR3","series-title":"Graduate texts in mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph theory","author":"JA Bondy","year":"2008","unstructured":"Bondy JA, Murty USR (2008) Graph theory. Graduate texts in mathematics, vol 244. Springer, New York"},{"key":"9380_CR4","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1093\/comjnl\/bxl018","volume":"49","author":"T Calamoneri","year":"2006","unstructured":"Calamoneri T (2006) The L(h,k)-labeling problem: a survey and annotated bibliography. Comput J 49:585\u2013608","journal-title":"Comput J"},{"key":"9380_CR5","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1016\/j.jpdc.2003.11.005","volume":"64","author":"T Calamoneri","year":"2004","unstructured":"Calamoneri T, Petreschi R (2004) L(h,1)-labeling subclasses of planar graphs. J Parallel Distrib Comput 64:414\u2013426","journal-title":"J Parallel Distrib Comput"},{"key":"9380_CR6","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1137\/S0895480193245339","volume":"9","author":"GJ Chang","year":"1996","unstructured":"Chang GJ, Kuo D (1996) The L(2,1)-labeling on graphs. SIAM J Discrete Math 9:309\u2013316","journal-title":"SIAM J Discrete Math"},{"key":"9380_CR7","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S0012-365X(02)00302-3","volume":"259","author":"JP Georges","year":"2002","unstructured":"Georges JP, Mauro DW (2002) On generalized Petersen graphs labeled with a condition at distance two. Discrete Math 259:311\u2013318","journal-title":"Discrete Math"},{"key":"9380_CR8","doi-asserted-by":"crossref","first-page":"1405","DOI":"10.1016\/j.disc.2007.07.075","volume":"308","author":"D Gon\u00e7alves","year":"2008","unstructured":"Gon\u00e7alves D (2008) On the L(p,1)-labelling of graphs. Discrete Math 308:1405\u20131414. Earlier version in EuroComb \u201905","journal-title":"Discrete Math"},{"key":"9380_CR9","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1137\/0405048","volume":"5","author":"JR Griggs","year":"1992","unstructured":"Griggs JR, Yeh RK (1992) Labeling graphs with a condition at distance two. SIAM J Discrete Math 5:586\u2013595","journal-title":"SIAM J Discrete Math"},{"key":"9380_CR10","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","volume":"68","author":"WK Hale","year":"1980","unstructured":"Hale WK (1980) The Frequency assignment: theory and application. Proc IEEE 68:1497\u20131514","journal-title":"Proc IEEE"},{"key":"9380_CR11","volume-title":"Proceedings of the ACM-SIAM symposium on discrete algorithm (SODA 2008)","author":"F Havet","year":"2008","unstructured":"Havet F, Reed B, Sereni JS (2008) L(2,1)-labelling of graphs. In: Proceedings of the ACM-SIAM symposium on discrete algorithm (SODA 2008), January 2008"},{"key":"9380_CR12","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1137\/050632609","volume":"22","author":"JH Kang","year":"2008","unstructured":"Kang JH (2008) L(2,1)-labelling for Hamiltonian graphs of maximum degree 3. SIAM J Discrete Math 22:213\u2013230","journal-title":"SIAM J Discrete Math"},{"key":"9380_CR13","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1137\/S0895480101399449","volume":"16","author":"D Kr\u00e1l","year":"2003","unstructured":"Kr\u00e1l D, \u0160krekovski R (2003) A theorem about channel assignment problem. SIAM J Discrete Math 16:426\u2013437","journal-title":"SIAM J Discrete Math"},{"key":"9380_CR14","unstructured":"Roberts FS, Working group agenda, DIMACS\/DIMATIA\/Renyi working group on graph colorings and their generalizations (2003), posted at http:\/\/dimacs.rutgers.edu\/Workshops\/GraphColor\/main.html"},{"key":"9380_CR15","doi-asserted-by":"crossref","first-page":"1217","DOI":"10.1016\/j.disc.2005.11.029","volume":"306","author":"RK Yeh","year":"2006","unstructured":"Yeh RK (2006) A survey on labeling graphs with a condition at distance two. Discrete Math 306:1217\u20131231","journal-title":"Discrete Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9380-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-011-9380-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9380-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:15Z","timestamp":1559262195000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-011-9380-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,21]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["9380"],"URL":"https:\/\/doi.org\/10.1007\/s10878-011-9380-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,21]]}}}