{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T10:18:08Z","timestamp":1773051488606,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540578994","type":"print"},{"value":"9783540483854","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57899-4_54","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T08:40:02Z","timestamp":1330245602000},"page":"211-224","source":"Crossref","is-referenced-by-count":11,"title":["Asteroidal triple-free graphs"],"prefix":"10.1007","author":[{"given":"Derek. G.","family":"Corneil","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephan","family":"Olariu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lorna","family":"Stewart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(89)90031-0","volume":"23","author":"S. Arnborg","year":"1989","unstructured":"S. Arnborg and A. Proskurowski, Linear time algorithms for NP-hard problems restricted to partial k-trees, Discrete Applied Mathematics 23 (1989), 11\u201324.","journal-title":"Discrete Applied Mathematics"},{"key":"19_CR2","unstructured":"F. Cheah, private communication."},{"key":"19_CR3","unstructured":"D.G. Corneil and P. A. Kamula, Extensions of permutation and interval graphs, Proceedings 18th Southeastern Conference on Combinatorics, Graph Theory and Computing (1987), 267\u2013276."},{"key":"19_CR4","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","volume":"3","author":"D. G. Corneil","year":"1981","unstructured":"D.G. Corneil, H. Lerchs, L. Stewart Burlingham, Complement reducible graphs, Discrete. Applied Mathematics 3 (1981), 163\u2013174.","journal-title":"Discrete. Applied Mathematics"},{"key":"19_CR5","unstructured":"D. G. Corneil, S. Olariu, and L. Stewart, Asteroidal triple-free graphs, Department of Computer Science, University of Toronto, Technical Report 262\/92, June 1992."},{"key":"19_CR6","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0166-218X(88)90032-7","volume":"21","author":"I. Degan","year":"1988","unstructured":"I. Degan, M.C. Golumbic and R.Y. Pinter, Trapezoid graphs and their coloring, Discrete Applied Mathematics 21 (1988), 35\u201346.","journal-title":"Discrete Applied Mathematics"},{"key":"19_CR7","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1145\/321707.321710","volume":"19","author":"S. Even","year":"1972","unstructured":"S. Even, A. Pnueli and A. Lempel, Permutation graphs and transitive graphs, Journal of the ACM 19 (1972), 400\u2013410.","journal-title":"Journal of the ACM"},{"key":"19_CR8","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF02020961","volume":"18","author":"T. Gallai","year":"1967","unstructured":"T. Gallai, Transitive orientierbare Graphen, Acta Mathematica Academiae Scientiarum Hungaricae 18 (1967), 25\u201366.","journal-title":"Acta Mathematica Academiae Scientiarum Hungaricae"},{"key":"19_CR9","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M. C. Golumbic","year":"1980","unstructured":"M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs Freeman, New York (1980)."},{"key":"19_CR10","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0166-218X(84)90016-7","volume":"9","author":"M. C. Golumbic","year":"1984","unstructured":"M.C. Golumbic, C.L. Monma and W.T. Trotter Jr., Tolerance graphs, Discrete Applied Mathematics 9 (1984), 157\u2013170.","journal-title":"Discrete Applied Mathematics"},{"key":"19_CR11","unstructured":"D. Kratsch and L. Stewart, Domination on cocomparability graphs, submitted for publication, 1989."},{"key":"19_CR12","doi-asserted-by":"crossref","first-page":"45","DOI":"10.4064\/fm-51-1-45-64","volume":"51","author":"C. G. Lekkerkerker","year":"1962","unstructured":"C.G. Lekkerkerker and J.C. Boland, Representation of afinite graph by aset of intervals on the real line, Fundamenta Mathematicae 51 (1962), 45\u201364.","journal-title":"Fundamenta Mathematicae"},{"key":"19_CR13","unstructured":"F. Maffray, private communication."},{"key":"19_CR14","unstructured":"R.H. M\u00f6hring, private communication."}],"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\/3-540-57899-4_54.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:09:37Z","timestamp":1619557777000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57899-4_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578994","9783540483854"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-57899-4_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994]]}}}