{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:12:59Z","timestamp":1725455579094},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540637578"},{"type":"electronic","value":"9783540696438"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0024504","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T02:30:56Z","timestamp":1132367456000},"page":"273-287","source":"Crossref","is-referenced-by-count":5,"title":["Bicliques in graphs II: Recognizing k-path graphs and underlying graphs of line digraphs"],"prefix":"10.1007","author":[{"given":"Erich","family":"Prisner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"23_CR1","unstructured":"R.E.L. Aldred, M.N. Ellingham, R. Hemminger, P. Jipsen, P\n3-isomorphisms for graphs, preprint 1995."},{"key":"23_CR2","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1002\/jgt.3190130406","volume":"13","author":"H.-J. Broersma","year":"1989","unstructured":"H.-J. Broersma, C. Hoede, Path graphs, J. Graph Theory 13 (1989) 427\u2013444.","journal-title":"J. Graph Theory"},{"key":"23_CR3","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0166-218X(90)90141-X","volume":"29","author":"V. Chvatal","year":"1990","unstructured":"V. Chvatal, C. Ebenegger, A note on line digraphs and the directed max-cut problem, Discrete Applied Math. 29 (1990) 165\u2013170.","journal-title":"Discrete Applied Math."},{"key":"23_CR4","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1109\/TC.1984.1676455","volume":"C-33","author":"M.A. Fiol","year":"1984","unstructured":"M.A. Fiol, J.L.A. Yebra, I. Alegre, Line digraph iterations and the (d, k) digraph problem, IEEE Transactions on Computers C-33 (1984) 400\u2013403.","journal-title":"IEEE Transactions on Computers"},{"key":"23_CR5","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1145\/321850.321853","volume":"21","author":"P.G.H. Lehot","year":"1974","unstructured":"P.G.H. Lehot, An optimal algorithm to detect a line graph and output its root graph, J. Assoc. Comput. Mach. 21 (1974) 569\u2013575.","journal-title":"J. Assoc. Comput. Mach."},{"key":"23_CR6","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1002\/(SICI)1097-0118(199601)21:1<81::AID-JGT11>3.0.CO;2-V","volume":"21","author":"X. Li","year":"1996","unstructured":"Xueliang Li, Isomorphisms of P\n3-graphs, J. Graph Theory 21 (1996) 81\u201385.","journal-title":"J. Graph Theory"},{"key":"23_CR7","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1002\/jgt.3190170403","volume":"17","author":"H. Li","year":"1993","unstructured":"H. Li, Y. Lin, On the characterization of path graph, J. Graph Theory 17 (1993) 463\u2013466.","journal-title":"J. Graph Theory"},{"key":"23_CR8","unstructured":"E. Prisner, Graphs with few cliques, in: Graph Theory, Combinatorics, and Applications: Proceedings of 7th Quadrennial International Conference on the Theory and Applications of Graphs (Y. Alavi, A. Schwenk ed.) John Wiley and Sons, Inc. (1995) 945\u2013956"},{"key":"23_CR9","unstructured":"E. Prisner, Bicliques in graphs I: Bounds on their number, (1996) submitted."},{"key":"23_CR10","unstructured":"E. Prisner, Graph Dynamics, Pitman Research Notes in Mathematics Series 338 (1995), Longman, Essex."},{"key":"23_CR11","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/0020-0190(73)90029-X","volume":"2","author":"N.D. Roussopoulos","year":"1973","unstructured":"N.D. Roussopoulos, A max{m, n} algorithm for determining the graph H from its line graph G, Inform. Process. Lett. 2 (1973) 108\u2013112.","journal-title":"Inform. Process. Lett."},{"key":"23_CR12","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1137\/0206036","volume":"6","author":"S. Tsukiyama","year":"1977","unstructured":"S. Tsukiyama, M. Ide, M. Aiyoshi, I. Shirawaka, A new algorithm for generating all the independent sets, SIAM J. Computing 6 (1977) 505\u2013517.","journal-title":"SIAM J. Computing"},{"key":"23_CR13","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1016\/0166-218X(92)90156-5","volume":"37\/38","author":"J.L. Villar","year":"1992","unstructured":"J.L. Villar, The underlying graph of a line digraph, Discrete Applied Math. 37\/38 (1992) 525\u2013538.","journal-title":"Discrete Applied Math."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0024504","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T17:30:15Z","timestamp":1549301415000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0024504"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540637578","9783540696438"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0024504","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}