{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:47:18Z","timestamp":1725544038557},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642114397"},{"type":"electronic","value":"9783642114403"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11440-3_19","type":"book-chapter","created":{"date-parts":[[2010,2,2]],"date-time":"2010-02-02T16:03:36Z","timestamp":1265126616000},"page":"204-215","source":"Crossref","is-referenced-by-count":2,"title":["On Some Simple Widths"],"prefix":"10.1007","author":[{"given":"Ling-Ju","family":"Hung","sequence":"first","affiliation":[]},{"given":"Ton","family":"Kloks","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","unstructured":"Chandler, D.B., Chang, M.S., Kloks, T., Peng, S.L.: Probe graphs (manuscript, 2009), \n                    \n                      http:\/\/www.cs.ccu.edu.tw\/~hunglc\/ProbeGraphs.pdf"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF02020961","volume":"18","author":"T. Gallai","year":"1967","unstructured":"Gallai, T.: Transitiv orientierbare graphen. Acta Math. Acad. Sci. Hungar.\u00a018, 25\u201366 (1967)","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","volume":"3","author":"D.G. Corneil","year":"1981","unstructured":"Corneil, D.G., Lerchs, L.H.: Stewart-Burlingham: Complement reducible graphs. Discrete Applied Mathematics\u00a03, 163\u2013174 (1981)","journal-title":"Discrete Applied Mathematics"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/978-3-642-02017-9_18","volume-title":"TAMC 2009","author":"M.S. Chang","year":"2009","unstructured":"Chang, M.S., Hung, L.J., Kloks, T., Peng, S.L.: Block-graph width. In: Chen, J., Cooper, S.B. (eds.) TAMC 2009. LNCS, vol.\u00a05532, pp. 150\u2013157. Springer, Heidelberg (2009)"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","first-page":"301","volume-title":"IWOCA 2009","author":"L.J. Hung","year":"2009","unstructured":"Hung, L.J., Kloks, T., Lee, C.M.: Trivially-perfect width. In: Fiala, J., Kratochv\u00edl, J., Miller, M. (eds.) IWOCA 2009. LNCS, vol.\u00a05874, pp. 301\u2013311. Springer, Heidelberg (2009)"},{"key":"19_CR6","unstructured":"Oum, S.: Graphs of bounded rank-width. PhD thesis, Princeton University (2005)"},{"key":"19_CR7","unstructured":"Hung, L.J., Kloks, T.: On the cograph-width of graphs (manuscript, 2009)"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-540-74839-7_22","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"V.B. Le","year":"2007","unstructured":"Le, V.B., de Ridder, H.N.: Characterizations and linear-time recognition of probe cographs. In: Brandst\u00e4dt, A., Kratsch, D., M\u00fcller, H. (eds.) WG 2007. LNCS, vol.\u00a04769, pp. 226\u2013237. Springer, Heidelberg (2007)"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"210","DOI":"10.2307\/1993287","volume":"95","author":"J. Kruskal","year":"1960","unstructured":"Kruskal, J.: Well-quasi-ordering, the tree theorem, and Vazsonyi\u2019s conjecture. Transactions of the American Mathematical Society\u00a095, 210\u2013225 (1960)","journal-title":"Transactions of the American Mathematical Society"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"2491","DOI":"10.1090\/S0002-9947-99-02400-9","volume":"352","author":"S. Thomass\u00e9","year":"2000","unstructured":"Thomass\u00e9, S.: On better-quasi-ordering countable series-parallel orders. Transactions of the American Mathematical Society\u00a0352, 2491\u20132505 (2000)","journal-title":"Transactions of the American Mathematical Society"},{"key":"19_CR11","series-title":"SIAM Monographs on Discrete Mathematics and Applications","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719796","volume-title":"Graph Classes: A survey","author":"A. Brandst\u00e4dt","year":"1999","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A survey. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia (1999)"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1093\/qmath\/28.4.417","volume":"28","author":"E. Howorka","year":"1977","unstructured":"Howorka, E.: A characterization of distance-hereditary graphs. Quarterly Journal of Mathematics\u00a028, 417\u2013420 (1977)","journal-title":"Quarterly Journal of Mathematics"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1007\/3-540-63890-3_37","volume-title":"Algorithms and Computation","author":"M.S. Chang","year":"1997","unstructured":"Chang, M.S., Hsieh, S.Y., Chen, G.H.: Dynamic programming on distance-hereditary graphs. In: Leong, H.-V., Jain, S., Imai, H. (eds.) ISAAC 1997. LNCS, vol.\u00a01350, pp. 344\u2013353. Springer, Heidelberg (1997)"},{"issue":"1-3","key":"19_CR14","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0012-365X(92)00468-7","volume":"127","author":"P.J. Cameron","year":"1994","unstructured":"Cameron, P.J.: Two-graphs and trees. Discrete Mathematics\u00a0127(1-3), 63\u201374 (1994)","journal-title":"Discrete Mathematics"},{"key":"19_CR15","volume-title":"Selected works of J. J. Seidel","author":"J.J. Seidel","year":"1991","unstructured":"Seidel, J.J.: Geometry and combinatorics. In: Corneil, D.G., Mathon, R. (eds.) Selected works of J. J. Seidel. Academic Press, London (1991)"},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0012-365X(72)90006-4","volume":"2","author":"L. Lov\u00e1sz","year":"1972","unstructured":"Lov\u00e1sz, L.: Normal hypergraphs and the weak perfect graph conjecture. Discrete Mathematics\u00a02, 253\u2013267 (1972)","journal-title":"Discrete Mathematics"},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0095-8956(88)90071-8","volume":"45","author":"S. Olariu","year":"1988","unstructured":"Olariu, S.: No antitwins in minimal imperfect graphs. Journal of Combinatorial Theory, Series B\u00a045, 255\u2013257 (1988)","journal-title":"Journal of Combinatorial Theory, Series B"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11440-3_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:40:33Z","timestamp":1606185633000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11440-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114397","9783642114403"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11440-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}