{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:23:16Z","timestamp":1725456196795},"publisher-location":"Berlin\/Heidelberg","reference-count":10,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540582746"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0019431","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T06:16:42Z","timestamp":1132640202000},"page":"128-142","source":"Crossref","is-referenced-by-count":0,"title":["Triangle graphs and their coloring"],"prefix":"10.1007","author":[{"given":"Yaw -Ling","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"K.P. Bogart, G. Isaak, L. Langley, and P.C. Fishburn. Proper and unit tolerance graphs. Technical Report 91-74, DIMACS, November 1991."},{"key":"9_CR2","unstructured":"T. Corman, C. Leiserson, and R. Rivest. Introduction to Algorithms. MIT Press, 1990."},{"key":"9_CR3","unstructured":"D.G. Corneil and P.A. Kamula. Extensions of permutation and interval graphs. In Proc. 18th Southeastern Conference on Combinatorics, Graph theory and Computing, pages 267\u2013276, 1987."},{"key":"9_CR4","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0166-218X(88)90032-7","volume":"21","author":"I. Dagan","year":"1988","unstructured":"I. Dagan, M.C. Golumbic, and R.Y. Pinter. Trapezoid graphs and their coloring. Discr. Applied Math., 21:35\u201346, 1988.","journal-title":"Discr. Applied Math."},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"S. Felsner. Tolerance graphs and orders. In E.W. Mayr, editor, Proc. 18th Internat. Workshop Graph-Theoret. Concepts Comput. Sci WG 92, Lecture Notes in Computer Science 657, pages 17\u201326. Springer-Verlag, 1992.","DOI":"10.1007\/3-540-56402-0_32"},{"key":"9_CR6","unstructured":"S. Felsner, R. M\u00fcller, and L. Wernisch. Optimal algorithms for trapezoid graphs. Technical Report 368, Technische Universit\u00e4t Berlin, 1993."},{"key":"9_CR7","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"M.C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980."},{"key":"9_CR8","first-page":"321","volume":"35","author":"M.C. Golumbic","year":"1982","unstructured":"M.C. Golumbic and C.L. Monma. A generalization of interval graphs with tolerances. Congr. Numer., 35:321\u2013331, 1982.","journal-title":"Congr. Numer."},{"key":"9_CR9","volume-title":"volume 1 of The Art of Computer Programming","author":"D. E. Knuth","year":"1968","unstructured":"D. E. Knuth. Fundamental Algorithms, volume 1 of The Art of Computer Programming. Addison-Wesley, Reading, MA, 1968."},{"key":"9_CR10","unstructured":"T.-H. Ma and J.P. Spinrad. An O(n2) time algorithm for the 2-chain cover problem and related problems. In Proc. 2nd ACM-SIAM Symp. Discrete Algorithms, pages 363\u2013372, 1991."}],"container-title":["Lecture Notes in Computer Science","Orders, Algorithms, and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0019431.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:42:40Z","timestamp":1607550160000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0019431"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540582746"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0019431","relation":{},"subject":[]}}