{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T21:22:10Z","timestamp":1648934530130},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2011,9,27]],"date-time":"2011-09-27T00:00:00Z","timestamp":1317081600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2012,11]]},"DOI":"10.1007\/s00373-011-1081-7","type":"journal-article","created":{"date-parts":[[2011,9,26]],"date-time":"2011-09-26T06:45:53Z","timestamp":1317019553000},"page":"831-842","source":"Crossref","is-referenced-by-count":0,"title":["Graph Equation for Line Graphs and m-Step Graphs"],"prefix":"10.1007","volume":"28","author":[{"given":"Seog-Jin","family":"Kim","sequence":"first","affiliation":[]},{"given":"Suh-Ryung","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Jung Yeun","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Won Jin","family":"Park","sequence":"additional","affiliation":[]},{"given":"Yoshio","family":"Sano","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,9,27]]},"reference":[{"key":"1081_CR1","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0012-365X(81)90001-7","volume":"34","author":"J. Akiyama","year":"1981","unstructured":"Akiyama J., Era H., Exoo G.: Further results on graph equations for line graphs and nth power graphs. Discret. Math. 34, 209\u2013218 (1981)","journal-title":"Discret. Math."},{"key":"1081_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J.A. Bondy","year":"1976","unstructured":"Bondy J.A., Murty U.S.R.: Graph Theory with Applications. North Holland, New York (1976)"},{"key":"1081_CR3","doi-asserted-by":"crossref","first-page":"2965","DOI":"10.1016\/j.disc.2010.07.003","volume":"310","author":"D.W. Cranston","year":"2010","unstructured":"Cranston D.W., Kim S.-J., Yu G.: Injective colorings of sparse graphs. Discret. Math. 310, 2965\u2013 2973 (2010)","journal-title":"Discret. Math."},{"key":"1081_CR4","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1002\/jgt.3190030402","volume":"3","author":"D.M. Cvetkovi\u0107","year":"1979","unstructured":"Cvetkovi\u0107 D.M., Simi\u0107 S.K.: A bibliography of graph equations. J.Graph Theory. 3, 311\u2013324 (1979)","journal-title":"J.Graph Theory."},{"key":"1081_CR5","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1016\/j.disc.2009.04.020","volume":"310","author":"A. Doyon","year":"2010","unstructured":"Doyon A., Hahn G., Raspaud A.: Some bounds on the injective chromatic number of sparse graphs. Discret. Math. 310, 585\u2013590 (2010)","journal-title":"Discret. Math."},{"key":"1081_CR6","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0012-365X(01)00466-6","volume":"256","author":"G. Hahn","year":"2002","unstructured":"Hahn G., Kratochv\u00edl J., \u0160ir\u00e1\u0148 J., Sotteau D.: On the injective chromatic number of graphs. Discret. Math. 256, 179\u2013192 (2002)","journal-title":"Discret. Math."},{"key":"1081_CR7","first-page":"33","volume":"8","author":"H.J. Greenberg","year":"1983","unstructured":"Greenberg H.J., Lundgren J.R., Maybee J.S.: The inversion of 2-step graphs. J. Combin. Inf. Syst. Sci. 8, 33\u201343 (1983)","journal-title":"J. Combin. Inf. Syst. Sci."},{"key":"1081_CR8","unstructured":"Lu\u017ear, B., \u0160krekovski, R., Tancer, M. : Injective colorings of planar graphs with few colors. Discret. Math. To appear"},{"key":"1081_CR9","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0012-365X(93)90122-A","volume":"119","author":"J.R. Lundgren","year":"1993","unstructured":"Lundgren J.R., Rasmussen C.W.: Two-step graphs of trees. Discret. Math. 119, 123\u2013139 (1993)","journal-title":"Discret. Math."},{"key":"1081_CR10","unstructured":"Phelps, E.B.: Chordal graph with chordal 2-step graphs. Master\u2019s thesis, University of Colorado at Denver (1992)"},{"issue":"47","key":"1081_CR11","first-page":"203","volume":"33","author":"S.K. Simi\u0107","year":"1983","unstructured":"Simi\u0107 S.K.: Graph equations for line graphs and nth distance graphs. Publ. Inst. Math. (Beograd) (N.S.) 33(47), 203\u2013216 (1983)","journal-title":"Publ. Inst. Math. (Beograd) (N.S.)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1081-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-011-1081-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1081-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:33Z","timestamp":1559055513000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-011-1081-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9,27]]},"references-count":11,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2012,11]]}},"alternative-id":["1081"],"URL":"https:\/\/doi.org\/10.1007\/s00373-011-1081-7","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,9,27]]}}}