{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T07:39:25Z","timestamp":1649144365246},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,5,27]],"date-time":"2017-05-27T00:00:00Z","timestamp":1495843200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Istanbul Center for Mathematical Sciences"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s00373-017-1782-7","type":"journal-article","created":{"date-parts":[[2017,5,27]],"date-time":"2017-05-27T04:56:34Z","timestamp":1495860994000},"page":"595-615","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Complexity of the Improper Twin Edge Coloring of Graphs"],"prefix":"10.1007","volume":"33","author":[{"given":"Paniz","family":"Abedin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saieed","family":"Akbari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Demange","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T\u0131naz","family":"Ekim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,27]]},"reference":[{"key":"1782_CR1","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/j.jctb.2005.01.001","volume":"94","author":"L Addario-Berry","year":"2005","unstructured":"Addario-Berry, L., Aldred, R.E.L., Dalal, K., Reed, B.A.: Vertex colouring edge partitions. J. Comb. Theory (B) 94, 237\u2013244 (2005)","journal-title":"J. Comb. Theory (B)"},{"key":"1782_CR2","doi-asserted-by":"crossref","first-page":"613","DOI":"10.7151\/dmgt.1756","volume":"34","author":"E Andrews","year":"2014","unstructured":"Andrews, E., Helenius, L., Johnston, D., VerWys, J., Zhang, Ping: On twin edge colorings of graphs. Discuss. Math. Graph Theory 34, 613\u2013627 (2014)","journal-title":"Discuss. Math. Graph Theory"},{"key":"1782_CR3","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.ejc.2016.02.002","volume":"55","author":"M Anholcer","year":"2016","unstructured":"Anholcer, M., Cichacz, S.: Group sum chromatic number of graphs. Eur. J. Comb. 55, 73\u201381 (2016)","journal-title":"Eur. J. Comb."},{"key":"1782_CR4","doi-asserted-by":"crossref","unstructured":"Anholcer, M., Cichacz, S., Milanic\u0306, M.: Group irregularity strength of connected graphs. J. Comb. Optim. 30(1), 1\u201317 (2015)","DOI":"10.1007\/s10878-013-9628-6"},{"key":"1782_CR5","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1038\/scientificamerican1077-108","volume":"237","author":"K Appel","year":"1977","unstructured":"Appel, K., Haken, W.: The solution of the four-color map problem. Sci. Amer. 237, 108\u2013121 (1977)","journal-title":"Sci. Amer."},{"key":"1782_CR6","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1017\/S030500410002168X","volume":"37","author":"RL Brooks","year":"1941","unstructured":"Brooks, R.L.: On colouring the nodes of a network. Math. Proc. Camb. Philos. Soc. 37, 194\u2013197 (1941)","journal-title":"Math. Proc. Camb. Philos. Soc."},{"key":"1782_CR7","doi-asserted-by":"crossref","DOI":"10.1201\/9781584888017","volume-title":"Chromatic Graph Theory","author":"G Chartrand","year":"2008","unstructured":"Chartrand, G., Zhang, P.: Chromatic Graph Theory. CRC Press, Boca Raton (2008)"},{"key":"1782_CR8","unstructured":"Clarke, G., Demange, M., Roshchina, V.: Lecture Notes-Discrete Mathematics, RMIT University"},{"key":"1782_CR9","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/s00373-006-0671-2","volume":"22","author":"K Edwards","year":"2006","unstructured":"Edwards, K., Horn\u00e1k, M., Wozniak, M.: On the neighbour-distinguishing index of a graph. Graphs Comb. 22, 341\u2013350 (2006)","journal-title":"Graphs Comb."},{"key":"1782_CR10","doi-asserted-by":"crossref","first-page":"1329","DOI":"10.1007\/s00373-012-1191-x","volume":"29","author":"E Flandrin","year":"2013","unstructured":"Flandrin, E., Marczyk, A., Przyby\u0142o, J., Sacl\u00e9, J.-F., Wo\u017aniak, M.: Neighbor sum distinguishing index. Graphs Comb. 29, 1329\u20131336 (2013)","journal-title":"Graphs Comb."},{"key":"1782_CR11","volume-title":"Computers and Intractability, a Guide to the Theory of $$\\cal{NP}$$ NP","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, a Guide to the Theory of \n                        $$\\cal{NP}$$\n                        \n                            \n                                            \n                                NP\n                            \n                        \n                    -Completeness. Freeman, New York (1979)"},{"key":"1782_CR12","volume-title":"Algorithmic Graph Theory and Perfect Graphs, Computer Science and Applied Mathematics","author":"MC Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs, Computer Science and Applied Mathematics. Academic Press, New York (1980)"},{"key":"1782_CR13","first-page":"159","volume":"76","author":"R Jones","year":"2011","unstructured":"Jones, R., Kolasinski, K., Okamoto, F., Zhang, P.: Modular neighbor-distinguishing edge colorings of graphs. J. Combin. Math. Combin. Comput. 76, 159\u2013175 (2011)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"1782_CR14","first-page":"295","volume":"82","author":"R Jones","year":"2012","unstructured":"Jones, R., Kolasinski, K., Okamoto, F., Zhang, P.: On modular chromatic indexes of graphs. J. Combin. Math. Combin. Comput. 82, 295\u2013306 (2012)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"1782_CR15","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/j.jctb.2003.12.001","volume":"91","author":"M Karonski","year":"2004","unstructured":"Karonski, M., Luczak, T., Thomason, A.: Edge weights and vertex colours. J. Combin. Theory (B) 91, 151\u2013157 (2004)","journal-title":"J. Combin. Theory (B)"},{"key":"1782_CR16","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1137\/0406032","volume":"6","author":"D Kratsch","year":"1993","unstructured":"Kratsch, D., Stewart, L.: Domination on cocomparability graphs. SIAM J. Discret. Math. 6, 400\u2013417 (1993)","journal-title":"SIAM J. Discret. Math."},{"key":"1782_CR17","doi-asserted-by":"crossref","unstructured":"Robertson, N., Sanders, D.P., Seymour, P., Thomas, R.: Efficiently four-coloring planar graphs. In: Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, pp. 571\u2013575, ACM (1996)","DOI":"10.1145\/237814.238005"},{"key":"1782_CR18","unstructured":"Seamone, B.: The 1-2-3 Conjecture and related problems: a survey. \n                        arXiv:1211.5122\n                        \n                     [math.CO] (2012) (Preprint)"},{"key":"1782_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-20394-2","volume-title":"Color-Induced Graph Colorings","author":"P Zhang","year":"2015","unstructured":"Zhang, P.: Color-Induced Graph Colorings. Springer, Berlin (2015)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-017-1782-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1782-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1782-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T18:42:32Z","timestamp":1498156952000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-017-1782-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,27]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["1782"],"URL":"https:\/\/doi.org\/10.1007\/s00373-017-1782-7","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,5,27]]}}}