{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T06:33:40Z","timestamp":1648535620265},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2008,11,1]],"date-time":"2008-11-01T00:00:00Z","timestamp":1225497600000},"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":[[2008,11]]},"DOI":"10.1007\/s00373-008-0808-6","type":"journal-article","created":{"date-parts":[[2008,12,1]],"date-time":"2008-12-01T09:27:42Z","timestamp":1228123662000},"page":"551-562","source":"Crossref","is-referenced-by-count":0,"title":["On the Determination Problem for P 4-Transformation of Graphs"],"prefix":"10.1007","volume":"24","author":[{"given":"Xueliang","family":"Li","sequence":"first","affiliation":[]},{"given":"Yan","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,12,2]]},"reference":[{"key":"808_CR1","doi-asserted-by":"crossref","unstructured":"Aldred, R.E.L., Ellingham, M.N., Hemminger, R.L., Jipsen, P.: P 3-isomorphisms for graphs. J. Graph Theory 26, 35\u201351 (1997)","DOI":"10.1002\/(SICI)1097-0118(199709)26:1<35::AID-JGT5>3.0.CO;2-I"},{"key":"808_CR2","doi-asserted-by":"crossref","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications, MacMillan\/Elesevier. London\/New York, 1976","DOI":"10.1007\/978-1-349-03521-2"},{"key":"808_CR3","doi-asserted-by":"crossref","unstructured":"Broersma, H.J., Hoede, C.: Path graphs. J. Graph Theory 13, 427\u2013444 (1989)","DOI":"10.1002\/jgt.3190130406"},{"key":"808_CR4","unstructured":"Gr\u00fcnbaum, B.: Incidence patterns of graphs and complexes. Lecture Notes in Mathematics (eds. G. Chartrand, S.F. Kapoor) 110, 115\u2013128 (1969)"},{"key":"808_CR5","unstructured":"Hemminger, R.L., Beineke, L.W.: Line graphs and line digraphs. In: Beineke, L.W., Wilson, R.J. eds. Selected Topics in Graph Theory, Academic Press, London, New York, San Francisco, 1978"},{"key":"808_CR6","doi-asserted-by":"crossref","unstructured":"Jung, H.A.: Zu einem isomorphiesatz von H. Whitney f\u00fcr graphen. Math. Ann. 164, 270\u2013271 (1966)","DOI":"10.1007\/BF01360250"},{"key":"808_CR7","doi-asserted-by":"crossref","unstructured":"Li, H., Lin, Y.: On the charaterization of path graphs. J. Graph Theory 17, 463\u2013466 (1993)","DOI":"10.1002\/jgt.3190170403"},{"key":"808_CR8","doi-asserted-by":"crossref","unstructured":"Li, X.: Isomorphisms of P 3-graphs. J. Graph Theory 21, 81\u201385 (1996)","DOI":"10.1002\/(SICI)1097-0118(199601)21:1<81::AID-JGT11>3.0.CO;2-V"},{"key":"808_CR9","unstructured":"Li, X.: On the determination problem for P 3-transformation of graphs. Ars Combinatoria 49, 296\u2013302 (1998)"},{"key":"808_CR10","unstructured":"Li, X., Zhao, B.: Isomorphisms of P 4-graphs. Australasian J. Combinatorics 15, 135\u2013143 (1997)"},{"key":"808_CR11","doi-asserted-by":"crossref","unstructured":"Li, X., Zhao, B.: Isomorphisms of P k -graphs for k \u2265\u00a04. Discrete Math. 289, 71\u201380 (2004)","DOI":"10.1016\/j.disc.2004.09.006"},{"key":"808_CR12","doi-asserted-by":"crossref","unstructured":"Prisner, E.: The dynamics of the line and path graph operators. Graphs and Combinatorics 9, 335\u2013352 (1993)","DOI":"10.1007\/BF02988321"},{"key":"808_CR13","doi-asserted-by":"crossref","unstructured":"Prisner, E.: A common generalization of line graphs and clique graphs. J. Graph Theory 18, 301\u2013313 (1994)","DOI":"10.1002\/jgt.3190180308"},{"key":"808_CR14","unstructured":"Prisner, E.: Line graphs and generalizations \u2014 a survey. In: Surveys in Graph Theory (G. Chartrand, M. Jacobson eds.) Congressus Numerantium 116, 193\u2013230 (1996)"},{"key":"808_CR15","doi-asserted-by":"crossref","unstructured":"Prisner, E.: Bicliques in graphs. II. Recognizing k-path graphs and underlying graphs of line digraphs. Graph-Theoretic Concepts in Computer Science (Berlin, 1997), 273\u2013287, Lecture Notes in Comput. Sci., 1335, Springer, Berlin, 1997","DOI":"10.1007\/BFb0024504"},{"key":"808_CR16","doi-asserted-by":"crossref","unstructured":"Prisner, E.: Bicliques in graphs I: Bounds on their number. Combinatorica 20(1), 109\u2013117 (2000)","DOI":"10.1007\/s004930070035"},{"key":"808_CR17","unstructured":"Prisner, E.: Recognizing k-path graphs. Proceedings of the 5th Twente Workshop on Graphs and Combinatorial Optimization (Enschede, 1997), Discrete Appl. Math. 99, 169\u2013181 (2000)"},{"key":"808_CR18","doi-asserted-by":"crossref","unstructured":"Van Bang Le, Prisner, E.: Iterated k-line graphs. Graphs and Combinatorics 10, 193\u2013203 (1994)","DOI":"10.1007\/BF02986664"},{"key":"808_CR19","doi-asserted-by":"crossref","unstructured":"Whitney, H.: Congruent graphs and connectivity of graphs. Amer. J. Math. 54, 150\u2013168 (1932)","DOI":"10.2307\/2371086"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-008-0808-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-008-0808-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-008-0808-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:28Z","timestamp":1559055508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-008-0808-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11]]},"references-count":19,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2008,11]]}},"alternative-id":["808"],"URL":"https:\/\/doi.org\/10.1007\/s00373-008-0808-6","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,11]]}}}