{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:47:00Z","timestamp":1759063620244},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,4,6]],"date-time":"2018-04-06T00:00:00Z","timestamp":1522972800000},"content-version":"tdm","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":[[2018,7]]},"DOI":"10.1007\/s10878-018-0288-4","type":"journal-article","created":{"date-parts":[[2018,4,6]],"date-time":"2018-04-06T21:36:13Z","timestamp":1523050573000},"page":"108-120","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["2-Distance vertex-distinguishing index of subcubic graphs"],"prefix":"10.1007","volume":"36","author":[{"given":"Victor","family":"Loumngam\u00a0Kamga","sequence":"first","affiliation":[]},{"given":"Weifan","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Ying","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Min","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,4,6]]},"reference":[{"key":"288_CR1","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1137\/0403038","volume":"3","author":"M Aigner","year":"1990","unstructured":"Aigner M, Triesch E (1990) Irregular assignments of trees and forests. SIAM J Discrete Math 3:439\u2013449","journal-title":"SIAM J Discrete Math"},{"key":"288_CR2","doi-asserted-by":"publisher","first-page":"3005","DOI":"10.1016\/j.disc.2004.12.027","volume":"306","author":"S Akbari","year":"2006","unstructured":"Akbari S, Bidkhori H, Nosrati N (2006) \n                    \n                      \n                    \n                    $$r$$\n                    \n                      \n                        r\n                      \n                    \n                  -Strong edge colorings of graphs. Discrete Math 306:3005\u20133010","journal-title":"Discrete Math"},{"key":"288_CR3","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1137\/S0895480102414107","volume":"21","author":"PN Balister","year":"2007","unstructured":"Balister PN, Gy\u0151ri E, Lehel J, Schelp RH (2007) Adjacent vertex distinguishing edge-colorings. SIAM J Discrete Math 21:237\u2013250","journal-title":"SIAM J Discrete Math"},{"key":"288_CR4","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0012-365X(01)00287-4","volume":"252","author":"PN Balister","year":"2002","unstructured":"Balister PN, Bollob\u00e1s B, Schelpa RH (2002) Vertex distinguishing colorings of graphs with \n                    \n                      \n                    \n                    $$\\Delta (G)=2$$\n                    \n                      \n                        \n                          \u0394\n                          (\n                          G\n                          )\n                          =\n                          2\n                        \n                      \n                    \n                  . Discrete Math 252:17\u201329","journal-title":"Discrete Math"},{"key":"288_CR5","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1006\/jctb.1998.1884","volume":"75","author":"C Bazgan","year":"1999","unstructured":"Bazgan C, Harkat-Benhamdine A, Li H, Wo\u017aniak M (1999) On the vertex-distinguishing proper edge-colorings of graphs. J Comb Theoey Ser B 75:288\u2013301","journal-title":"J Comb Theoey Ser B"},{"key":"288_CR6","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1002\/jgt.21862","volume":"81","author":"L Bezegov\u00e1","year":"2016","unstructured":"Bezegov\u00e1 L, Lu\u017ear B, Mockov\u010diakov\u00e1 M, Sot\u00e1k R, \u0160krekovski R (2016) Star edge coloring of some classes of graphs. J Graph Theory 81:73\u201382","journal-title":"J Graph Theory"},{"key":"288_CR7","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1017\/S030500410002168X","volume":"37","author":"LR Brooks","year":"1941","unstructured":"Brooks LR (1941) On colouring the nodes of a network. Proc Camb Philos Soc 37:194\u2013197","journal-title":"Proc Camb Philos Soc"},{"key":"288_CR8","unstructured":"Burris AC (1993) Vertex-distinguishing edge-colorings. Ph.D. Dissertation, Memphis State University"},{"key":"288_CR9","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1002\/(SICI)1097-0118(199710)26:2<73::AID-JGT2>3.0.CO;2-C","volume":"26","author":"AC Burris","year":"1997","unstructured":"Burris AC, Schelp RH (1997) Vertex-distinguishing proper edge-colorings. J Graph Theory 26:73\u201383","journal-title":"J Graph Theory"},{"key":"288_CR10","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1002\/jgt.21644","volume":"72","author":"Z Dvo\u0159\u00e1k","year":"2013","unstructured":"Dvo\u0159\u00e1k Z, Mohar B, \u0160\u00e1mal R (2013) Star chromatic index. J Graph Theory 72:313\u2013326","journal-title":"J Graph Theory"},{"key":"288_CR11","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.jctb.2005.04.002","volume":"95","author":"H Hatami","year":"2005","unstructured":"Hatami H (2005) \n                    \n                      \n                    \n                    $$\\Delta $$\n                    \n                      \n                        \u0394\n                      \n                    \n                  +300 is a bound on the the adjacent vertex distinguishing edge chromatic number. J Comb Theory Ser B 95:246\u2013256","journal-title":"J Comb Theory Ser B"},{"key":"288_CR12","unstructured":"Huang D, Lih KW, Wang W (2015) Legally \n                    \n                      \n                    \n                    $$(\\Delta +2)$$\n                    \n                      \n                        \n                          (\n                          \u0394\n                          +\n                          2\n                          )\n                        \n                      \n                    \n                  -coloring bipartite outerplanar graphs in cubic time. Comb Optim Appl, 617\u2013632. Lecture Notes in Comput Sci 9486, Springer, Cham, 2015"},{"key":"288_CR13","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF02392606","volume":"15","author":"J Petersen","year":"1891","unstructured":"Petersen J (1891) Die Theorie ser regul\u00e4ren Graphsn. Acta Math 15:193\u2013220","journal-title":"Acta Math"},{"key":"288_CR14","doi-asserted-by":"publisher","first-page":"3092","DOI":"10.1016\/j.disc.2017.07.005","volume":"340","author":"B Vu\u010dkovi\u0107","year":"2017","unstructured":"Vu\u010dkovi\u0107 B (2017) Edge-partitions of graphs and their neighbor-distinguishing index. Discrete Math 340:3092\u20133096","journal-title":"Discrete Math"},{"key":"288_CR15","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10898-015-0360-x","volume":"65","author":"W Wang","year":"2016","unstructured":"Wang W, Huang D, Wang Y, Wang Y, Du DZ (2016) A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs. J Glob Optim 65:351\u2013367","journal-title":"J Glob Optim"},{"key":"288_CR16","unstructured":"Wang W, Wang Y, Huang D, Wang Y (2016) 2-Distance vertex-distinguishing edge coloring of graphs (submitted)"},{"key":"288_CR17","doi-asserted-by":"publisher","first-page":"2006","DOI":"10.1016\/j.disc.2015.05.007","volume":"338","author":"Y Wang","year":"2015","unstructured":"Wang Y, Wang W, Huo J (2015) Some bounds on the neighbor-distinguishing index of graphs. Discrete Math 338:2006\u20132013","journal-title":"Discrete Math"},{"key":"288_CR18","first-page":"703","volume":"49","author":"Z Zhang","year":"2006","unstructured":"Zhang Z, Li J, Chen X, Cheng H, Yao B (2006) \n                    \n                      \n                    \n                    $$D(\\beta )$$\n                    \n                      \n                        \n                          D\n                          (\n                          \u03b2\n                          )\n                        \n                      \n                    \n                  -vertex-distinguishing proper edge-coloring of graphs. Acta Math Sin (Chin Ser) 49:703\u2013708","journal-title":"Acta Math Sin (Chin Ser)"},{"key":"288_CR19","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1016\/S0893-9659(02)80015-5","volume":"15","author":"Z Zhang","year":"2002","unstructured":"Zhang Z, Liu L, Wang J (2002) Adjacent strong edge coloring of graphs. Appl Math Lett 15:623\u2013626","journal-title":"Appl Math Lett"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-018-0288-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0288-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0288-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,7]],"date-time":"2019-04-07T00:54:54Z","timestamp":1554598494000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-018-0288-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,6]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["288"],"URL":"https:\/\/doi.org\/10.1007\/s10878-018-0288-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,4,6]]},"assertion":[{"value":"6 April 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}