{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,15]],"date-time":"2024-06-15T11:54:58Z","timestamp":1718452498102},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,6,27]],"date-time":"2016-06-27T00:00:00Z","timestamp":1466985600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1007\/s10878-016-0047-3","type":"journal-article","created":{"date-parts":[[2016,6,27]],"date-time":"2016-06-27T15:06:32Z","timestamp":1467039992000},"page":"1421-1442","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On irreducible no-hole L(2,\u00a01)-coloring of subdivision of graphs"],"prefix":"10.1007","volume":"33","author":[{"given":"Nibedita","family":"Mandal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pratima","family":"Panigrahi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,27]]},"reference":[{"key":"47_CR1","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1016\/j.disc.2014.09.006","volume":"338","author":"FH Chang","year":"2015","unstructured":"Chang FH, Chia ML, Kuo D, Liaw SC, Tsai MH (2015) \n $$L(2,1)$$\n \n \n \n \n L\n (\n 2\n ,\n 1\n )\n \n \n \n -labelings of subdivisions of graphs. Discret Math 338:248\u2013255. doi:\n 10.1016\/j.disc.2014.09.006","journal-title":"Discret Math"},{"key":"47_CR2","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S0195-6698(02)00134-8","volume":"24","author":"GJ Chang","year":"2003","unstructured":"Chang GJ, Lu C (2003) Distance-two labelings of graphs. Eur J Comb 24:53\u201358. doi:\n 10.1016\/S0195-6698(02)00134-8","journal-title":"Eur J Comb"},{"key":"47_CR3","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1016\/S0166-218X(03)00329-9","volume":"130","author":"PC Fishburn","year":"2003","unstructured":"Fishburn PC, Roberts FS (2003) No-hole \n $$L(2,1)$$\n \n \n \n \n L\n (\n 2\n ,\n 1\n )\n \n \n \n -colorings. Discret Appl Math 130:513\u2013519. doi:\n 10.1016\/S0166-218X(03)00329-9","journal-title":"Discret Appl Math"},{"key":"47_CR4","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0012-365X(93)E0098-O","volume":"135","author":"JP Georges","year":"1994","unstructured":"Georges JP, Mauro DW, Whittlesey MA (1994) Relating path coverings to vertex labellings with a condition at distance two. Discret Math 135:103\u2013111. doi:\n 10.1016\/0012-365X(93)E0098-O","journal-title":"Discret Math"},{"key":"47_CR5","doi-asserted-by":"publisher","first-page":"1405","DOI":"10.1016\/j.disc.2007.07.075","volume":"308","author":"D Gon\u00e7laves","year":"2008","unstructured":"Gon\u00e7laves D (2008) On the \n $$L(p,1)$$\n \n \n \n \n L\n (\n p\n ,\n 1\n )\n \n \n \n -labelling of graphs. Discret Math 308:1405\u20131414. doi:\n 10.1016\/j.disc.2007.07.075","journal-title":"Discret Math"},{"issue":"4","key":"47_CR6","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/0405048","volume":"5","author":"JR Griggs","year":"1992","unstructured":"Griggs JR, Yeh RK (1992) Labelling graphs with a condition at distance 2. SIAM J Discret Math 5(4):586\u2013595. doi:\n 10.1137\/0405048","journal-title":"SIAM J Discret Math"},{"key":"47_CR7","unstructured":"Havet F, Yu ML (2002) \n $$(p,1)$$\n \n \n \n \n (\n p\n ,\n 1\n )\n \n \n \n -total labelling of graphs. Technical Report 4650, INRIA"},{"key":"47_CR8","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1016\/j.disc.2007.03.034","volume":"308","author":"F Havet","year":"2008","unstructured":"Havet F, Yu ML (2008) \n $$(p,1)$$\n \n \n \n \n (\n p\n ,\n 1\n )\n \n \n \n -total labelling of graphs. Discret Math 308:496\u2013513. doi:\n 10.1016\/j.disc.2007.03.034","journal-title":"Discret Math"},{"key":"47_CR9","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/s10878-013-9632-x","volume":"30","author":"N Karst","year":"2015","unstructured":"Karst N, Oehrlein J, Troxell DS, Zhu J (2015) \n $$L(d,1)$$\n \n \n \n \n L\n (\n d\n ,\n 1\n )\n \n \n \n -labelings of the edge-path-replacement by factorization of graphs. J Comb Optim 30:34\u201341. doi:\n 10.1007\/s10878-013-9632-x","journal-title":"J Comb Optim"},{"key":"47_CR10","first-page":"65","volume":"69","author":"RC Laskar","year":"2006","unstructured":"Laskar RC, Villalpando JJ (2006) Irreducibility of L(2,1)-coloring and inh-colorablity of unicyclic and hex graphs. Utilitas Mathematica 69:65\u201383","journal-title":"Utilitas Mathematica"},{"issue":"2","key":"47_CR11","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1002\/net.20286","volume":"53","author":"RC Laskar","year":"2009","unstructured":"Laskar RC, Matthews GL, Novick B, Villalpando J (2009) On irreducible no-hole \n $$L(2,1)$$\n \n \n \n \n L\n (\n 2\n ,\n 1\n )\n \n \n \n -coloring of trees. Networks 53(2):206\u2013211. doi:\n 10.1002\/net.20286","journal-title":"Networks"},{"key":"47_CR12","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s10878-012-9470-2","volume":"26","author":"D L\u00fc","year":"2013","unstructured":"L\u00fc D (2013) \n $$L(2,1)$$\n \n \n \n \n L\n (\n 2\n ,\n 1\n )\n \n \n \n -labelings of the edge path replacement of a graph. J Comb Optim 26:385\u2013392. doi:\n 10.1007\/s10878-012-9470-2","journal-title":"J Comb Optim"},{"key":"47_CR13","unstructured":"Villalpando J, Laskar R (2008) Irreducible no-hole colorings of grid graphs, hypercube and other bipartite graphs. Joint Mathematics Meetings"},{"issue":"4","key":"47_CR14","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1137\/S0895480192242821","volume":"8","author":"MA Whittlesey","year":"1995","unstructured":"Whittlesey MA, Georges JP, Mauro DW (1995) On the \n $$\\lambda $$\n \n \n \n \u03bb\n \n \n -number of \n $$Q_{n}$$\n \n \n \n \n Q\n n\n \n \n \n and related graphs. SIAM J Discret Math 8(4):499\u2013506. doi:\n 10.1137\/S0895480192242821","journal-title":"SIAM J Discret Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0047-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-016-0047-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0047-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0047-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,24]],"date-time":"2017-03-24T09:02:25Z","timestamp":1490346145000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-016-0047-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,27]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["47"],"URL":"https:\/\/doi.org\/10.1007\/s10878-016-0047-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,27]]}}}