{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T15:38:58Z","timestamp":1758123538645},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1995,12,1]],"date-time":"1995-12-01T00:00:00Z","timestamp":817776000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1995,12]]},"DOI":"10.1007\/bf02238229","type":"journal-article","created":{"date-parts":[[2005,11,14]],"date-time":"2005-11-14T17:27:19Z","timestamp":1131989239000},"page":"303-316","source":"Crossref","is-referenced-by-count":4,"title":["Isomorphism of chordal (6, 3) graphs"],"prefix":"10.1007","volume":"54","author":[{"given":"L.","family":"Babel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02238229_CR1","volume-title":"The design and analysis of computer algorithms","author":"A. V. Aho","year":"1974","unstructured":"Aho, A. V., Hopcroft, J. E., Ullman, J. D.: The design and analysis of computer algorithms. Reading: Addison-Wesley, 1974."},{"key":"BF02238229_CR2","doi-asserted-by":"crossref","unstructured":"Babai, L., Grigor'ev, D. Y., Mount, D. M.: Isomorphism of graphs with bounded eigenvalue multiplicity, In: Proc. 14th ACM Symposium on Theory of Computing 1982, pp. 310\u2013324.","DOI":"10.1145\/800070.802206"},{"key":"BF02238229_CR3","doi-asserted-by":"crossref","unstructured":"Babel, L., Olariu, S.: Isomorphism of graphs with fewP 4s (1994) [submitted].","DOI":"10.1007\/3-540-60618-1_63"},{"key":"BF02238229_CR4","series-title":"Lecture Notes in Computer Science","volume-title":"Directed path graph isomorphism","author":"L. Babel","year":"1994","unstructured":"Babel, L., Ponomarenko, I. N., Tinhofer, G.: Directed path graph isomorphism. To appear in Graph-Theoretic Concepts in Computer Science, 20th International Workshop, WG'94, Berlin, Heidelberg, New York, Tokyo: Springer 1994. [Lecture Notes in Computer Science]."},{"key":"BF02238229_CR5","unstructured":"Booth, K. S., Colbourn, C. J.: Problems polynomially equivalent to graph isomorphism, Report No. CS-77-04. Computer Science Department, University of Waterloo 1979."},{"key":"BF02238229_CR6","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1145\/322123.322125","volume":"26","author":"K. S. Booth","year":"1979","unstructured":"Booth, K. S., Lueker, G. S.: A linear-time algorithm for deciding interval graph isomorphism. J. ACM26, 183\u2013195 (1979).","journal-title":"J. ACM"},{"key":"BF02238229_CR7","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","volume":"3","author":"D. G. Corneil","year":"1981","unstructured":"Corneil, D. G., Lerchs, H., Stewart Burlingham, L.: Complement reducible graphs. Discr. Appl. Math.3 163\u2013174 (1981).","journal-title":"Discr. Appl. Math."},{"key":"BF02238229_CR8","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1002\/net.3230110103","volume":"11","author":"G. J. Colbourn","year":"1981","unstructured":"Colbourn, G. J.: On testing isomorphism of permutation graphs. Networks11, 13\u201321 (1981).","journal-title":"Networks"},{"key":"BF02238229_CR9","doi-asserted-by":"crossref","unstructured":"Filotti, I. S., Mayer, J. N.: A polynomial-time algorithm for determing the isomorphism of graphs of fixed genus. In: Proc. 12th ACM Symposium on Theory of Computing 1980, pp. 235\u2013243.","DOI":"10.1145\/800141.804671"},{"key":"BF02238229_CR10","unstructured":"Fontet, M.: A linear algorithm for testing isomorphism of planar, In: Proc. 3rd Colloquium on Automata, Languages and Programming 1976, pp. 411\u2013423."},{"key":"BF02238229_CR11","volume-title":"Algorithmic graph theory and perfect graphs","author":"M. C. Golumbic","year":"1980","unstructured":"Golumbic, M. C.: Algorithmic graph theory and perfect graphs. New York: Academic Press, 1980."},{"key":"BF02238229_CR12","doi-asserted-by":"crossref","unstructured":"Hopcroft, J. E., Wong, J. K.: Linear-time algorithm for isomorphism of planar graphs. In: Proc. 6th ACM Symposium on Theory of Computing 1974, pp. 172\u2013184.","DOI":"10.1145\/800119.803896"},{"key":"BF02238229_CR13","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/978-1-4684-2001-2_13","volume-title":"complexity of computer computations","author":"J. E. Hopcroft","year":"1972","unstructured":"Hopcroft, J. E., Tarjan, R. E.: Isomorphism of planar graphs, In: complexity of computer computations (Miller, R. E., Thatcher, J. W., eds.) pp. 131\u2013152. New York: Plenum Press 1972."},{"key":"BF02238229_CR14","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1002\/sapm198981179","volume":"81","author":"B. Jamison","year":"1989","unstructured":"Jamison, B., Olariu, S.:P 4-reducible graphs, a class of uniquely tree representable graphs. Stud. Appl. Math.81, 79\u201387 (1989).","journal-title":"Stud. Appl. Math."},{"key":"BF02238229_CR15","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1002\/sapm198981189","volume":"81","author":"B. Jamison","year":"1989","unstructured":"Jamison, B., Olariu, S.: A new class of brittle graphs. Stud. Appl. Math.81, 89\u201392 (1989).","journal-title":"Stud. Appl. Math."},{"key":"BF02238229_CR16","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0166-218X(92)90036-A","volume":"35","author":"B. Jamison","year":"1992","unstructured":"Jamison, B., Olariu, S.: A unique tree representation forP 4-sparse graphs. Disc. Appl. Math.35, 115\u2013129 (1992).","journal-title":"Disc. Appl. Math."},{"key":"BF02238229_CR17","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1137\/0603025","volume":"3","author":"M. M. Klawe","year":"1982","unstructured":"Klawe, M. M., Corneil, M. M., Proskurowski, A.: Isomorphism testing in hook-up graphs. SIAM J. Alg. Discr. Meth.3, 260\u2013274 (1982).","journal-title":"SIAM J. Alg. Discr. Meth."},{"key":"BF02238229_CR18","first-page":"3","volume":"81","author":"E. L. Lawler","year":"1976","unstructured":"Lawler, E. L.: Graphical algorithms and their complexity. Math. Centre Tracts81, 3\u201332 (1976).","journal-title":"Math. Centre Tracts"},{"key":"BF02238229_CR19","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/0022-0000(82)90009-5","volume":"25","author":"E. M. Luks","year":"1982","unstructured":"Luks, E. M.: Isomorphism of graphs of bounded valence can be tested in polynomial time. J. Comput. Syst. Sci.25, 42\u201365 (1982).","journal-title":"J. Comput. Syst. Sci."},{"key":"BF02238229_CR20","doi-asserted-by":"crossref","unstructured":"Miller, G. L.: Isomorphism testing for graphs of bounded genus. In: Proc. 12th ACM Symposium on Theory of Computing 1980, pp. 225\u2013235.","DOI":"10.1145\/800141.804670"},{"key":"BF02238229_CR21","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF02240204","volume":"36","author":"G. Tinhofer","year":"1986","unstructured":"Tinhofer, G.: Graph isomorphism and theorems of Birkhoff type. Computing36, 285\u2013300, (1986).","journal-title":"Computing"},{"key":"BF02238229_CR22","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0166-218X(88)90100-X","volume":"22","author":"G. Tinhofer","year":"1988\/89","unstructured":"Tinhofer, G.: Strong tree-cographs are Birkhoff graphs. Discr. Appl. Math.22, 275\u2013288 (1988\/89).","journal-title":"Discr. Appl. Math."},{"key":"BF02238229_CR23","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0166-218X(91)90049-3","volume":"30","author":"G. Tinhofer","year":"1991","unstructured":"Tinhofer, G.: A note on compact graphs. Discr. Appl. Math.30, 253\u2013264 (1991).","journal-title":"Discr. Appl. Math."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02238229.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02238229\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02238229","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T21:29:22Z","timestamp":1586554162000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02238229"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,12]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1995,12]]}},"alternative-id":["BF02238229"],"URL":"https:\/\/doi.org\/10.1007\/bf02238229","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,12]]}}}