{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:02:30Z","timestamp":1725552150333},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540310006"},{"type":"electronic","value":"9783540314684"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11604686_32","type":"book-chapter","created":{"date-parts":[[2005,12,5]],"date-time":"2005-12-05T15:02:01Z","timestamp":1133794921000},"page":"362-373","source":"Crossref","is-referenced-by-count":1,"title":["Computation of Chromatic Polynomials Using Triangulations and Clique Trees"],"prefix":"10.1007","author":[{"given":"Pascal","family":"Berthom\u00e9","sequence":"first","affiliation":[]},{"given":"Sylvain","family":"Lebresne","sequence":"additional","affiliation":[]},{"given":"Kim","family":"Nguy\u00ea\u0303n","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"32_CR1","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/BF01934264","volume":"34","author":"B. Aspvall","year":"1994","unstructured":"Aspvall, B., Heggernes, P.: Finding minimum height elimination trees for interval graphs in polynomial time. BIT\u00a034(4), 484\u2013509 (1994)","journal-title":"BIT"},{"key":"32_CR2","volume-title":"Graphs and Hypergraphs","author":"C. Berge","year":"1973","unstructured":"Berge, C.: Graphs and Hypergraphs. North Holland, Amsterdam (1973)"},{"issue":"4","key":"32_CR3","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1137\/0210059","volume":"10","author":"P.A. Bernstein","year":"1981","unstructured":"Bernstein, P.A., Goodman, N.: The power of natural semijoins. SIAM Journal of Computing\u00a010(4), 751\u2013771 (1981)","journal-title":"SIAM Journal of Computing"},{"key":"32_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-540-39890-5_6","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"A. Berry","year":"2003","unstructured":"Berry, A., Heggernes, P., Simonet, G.: The minimum degree heuristic and the minimal triangulation process. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol.\u00a02880, pp. 58\u201370. Springer, Heidelberg (2003)"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Berthom\u00e9, P., Lebresne, S., Nguy\u00ea\u0303n, K.: Computation of chromatic polynomials using triangulation and clique trees. Technical report, LRI-1403 (March 2005), Available at http:\/\/www.lri.fr\/~berthome\/biblio.html","DOI":"10.1007\/11604686_32"},{"key":"32_CR6","doi-asserted-by":"publisher","first-page":"355","DOI":"10.2307\/1990348","volume":"60","author":"G.D. Birkhoff","year":"1946","unstructured":"Birkhoff, G.D., Lewis, D.C.: Chromatic polynomials. Transactions of the American Mathematical Society\u00a060, 355\u2013451 (1946)","journal-title":"Transactions of the American Mathematical Society"},{"key":"32_CR7","first-page":"133","volume":"61","author":"N. Chandrasekharan","year":"1988","unstructured":"Chandrasekharan, N., Madhavan, C.E.V., Laskar, R.: Chromatic polynomials of chordal graphs. Congressus Numerantium\u00a061, 133\u2013142 (1988)","journal-title":"Congressus Numerantium"},{"key":"32_CR8","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/S0378-4371(02)00977-9","volume":"313","author":"S.-C. Chang","year":"2002","unstructured":"Chang, S.-C.: Exact chromatic polynomials for toroidal chain of complete graphs. Physica A\u00a0313, 397\u2013426 (2002)","journal-title":"Physica A"},{"key":"32_CR9","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/S0012-365X(01)00307-7","volume":"245","author":"F.M. Dong","year":"2002","unstructured":"Dong, F.M., Tep, K.L., Koh, K.M., Hendy, M.D.: Non-chordal graphs having integral-root chromatic polynomial II. Discrete Mathematics\u00a0245, 247\u2013253 (2002)","journal-title":"Discrete Mathematics"},{"key":"32_CR10","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/S0012-365X(98)00343-4","volume":"199","author":"G. Haggard","year":"1999","unstructured":"Haggard, G., Mathies, T.R.: Note on the computation of chromatic polynomials. Discrete Mathematics\u00a0199, 227\u2013231 (1999)","journal-title":"Discrete Mathematics"},{"key":"32_CR11","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s00022-003-1694-y","volume":"76","author":"B. Jackson","year":"2003","unstructured":"Jackson, B.: Zeros of chromatic and flow polynomials of graphs. Journal of Geometry\u00a076, 95\u2013109 (2003)","journal-title":"Journal of Geometry"},{"key":"32_CR12","first-page":"41","volume-title":"ACM Symposium On Theory of Computing","author":"A. Natanzon","year":"1998","unstructured":"Natanzon, A., Shamir, R., Sharan, R.: A polynomial approximation algorithm for the minimum fill-in problem. In: ACM (ed.) ACM Symposium On Theory of Computing, pp. 41\u201347. ACM Press, New York (1998)"},{"key":"32_CR13","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1017\/S0963548302005175","volume":"11","author":"J. Oxley","year":"2002","unstructured":"Oxley, J., Welsh, D.: Chromatic, flow and reliability polynomials: the complexity of their coefficients. Combinatorics, Probability and Computing\u00a011, 403\u2013426 (2002)","journal-title":"Combinatorics, Probability and Computing"},{"key":"32_CR14","first-page":"213","volume":"4","author":"D.R. Shier","year":"1988","unstructured":"Shier, D.R., Chandrasekharan, N.: Algorithms for computing the chromatic polynomial. Journal of Combinatorial Mathematics and Combinatorial Computing\u00a04, 213\u2013222 (1988)","journal-title":"Journal of Combinatorial Mathematics and Combinatorial Computing"},{"issue":"1","key":"32_CR15","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1137\/0602010","volume":"2","author":"M. Yannakakis","year":"1981","unstructured":"Yannakakis, M.: Computing the minimum fill-in is NP-complete. SIAM Journal on Algebraic and Discrete Methods\u00a02(1), 77\u201379 (1981)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"}],"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\/11604686_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:04:26Z","timestamp":1619507066000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11604686_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540310006","9783540314684"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11604686_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}