{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,14]],"date-time":"2026-10-14T06:13:25Z","timestamp":1791958405696,"version":"4.3.4"},"reference-count":11,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":4058,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Random Struct Algorithms"],"published-print":{"date-parts":[[1995,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A fully polynomial randomized approximation scheme is presented for estimating the number of (vertex) <jats:italic>k<\/jats:italic>\u2010colorings of a graph of maximum degree \u0394, when <jats:italic>k<\/jats:italic> \u2265 2\u0394 + 1. \u00a9 1995 John Wiley &amp; Sons, Inc.<\/jats:p>","DOI":"10.1002\/rsa.3240070205","type":"journal-article","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T18:47:37Z","timestamp":1180205257000},"page":"157-165","source":"Crossref","is-referenced-by-count":186,"title":["A very simple algorithm for estimating the number of k\u2010colorings of a low\u2010degree graph"],"prefix":"10.1002","volume":"7","author":[{"given":"Mark","family":"Jerrum","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","first-page":"243","volume-title":"S\u00e9minaire de Probabilit\u00e9s XVII 1981\/82","author":"Dold A."},{"key":"e_1_2_1_3_2","volume-title":"Extremal Graph Theory","author":"Bollob\u00e1s B\u00e9la","year":"1978"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1017\/S030500410002168X"},{"key":"e_1_2_1_5_2","doi-asserted-by":"crossref","DOI":"10.1214\/lnms\/1215467407","volume-title":"Group Representations in Probability and Statistics","author":"Diaconis Persi","year":"1988"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(76)90059-1"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01562538"},{"key":"e_1_2_1_8_2","first-page":"191","volume-title":"The Markov chain Monte Carlo method: analytical techniques and applications, Proc. IMA Conference on Complex Stochastic Systems and Engineering","author":"Jerrum Mark","year":"1995"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(86)90174-X"},{"key":"e_1_2_1_10_2","first-page":"56","volume-title":"Monte\u2010Carlo algorithms for enumeration and reliability problems","author":"Karp Richard M.","year":"1983"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.71.1778"},{"key":"e_1_2_1_12_2","unstructured":"Alan D.Sokal personal communication January1995."}],"container-title":["Random Structures &amp; Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Frsa.3240070205","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/rsa.3240070205","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T02:51:02Z","timestamp":1698288662000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/rsa.3240070205"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,9]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,9]]}},"alternative-id":["10.1002\/rsa.3240070205"],"URL":"https:\/\/doi.org\/10.1002\/rsa.3240070205","archive":["Portico"],"relation":{},"ISSN":["1042-9832","1098-2418"],"issn-type":[{"value":"1042-9832","type":"print"},{"value":"1098-2418","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,9]]}}}