{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T16:56:51Z","timestamp":1760029011280},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642114083"},{"type":"electronic","value":"9783642114090"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11409-0_26","type":"book-chapter","created":{"date-parts":[[2009,12,3]],"date-time":"2009-12-03T13:12:27Z","timestamp":1259845947000},"page":"296-307","source":"Crossref","is-referenced-by-count":11,"title":["Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes"],"prefix":"10.1007","author":[{"given":"Yoshio","family":"Okamoto","sequence":"first","affiliation":[]},{"given":"Ryuhei","family":"Uehara","sequence":"additional","affiliation":[]},{"given":"Takeaki","family":"Uno","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algor.\u00a012, 308\u2013340 (1991)","journal-title":"J. Algor."},{"key":"26_CR2","unstructured":"Chv\u00e1tal, V., Hammer, P.L.: Set-packing and threshold graphs. Res. Rep., Comput. Sci. Dept., Univ. Waterloo, CORR 73-21 (1973)"},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0166-218X(99)00184-5","volume":"101","author":"B. Courcelle","year":"2000","unstructured":"Courcelle, B., Olariu, S.: Upper bounds to the clique width of graphs. Discr. Appl. Math.\u00a0101, 77\u2013114 (2000)","journal-title":"Discr. Appl. Math."},{"key":"26_CR4","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/0304-3975(92)90234-7","volume":"102","author":"P. Dagum","year":"1992","unstructured":"Dagum, P., Luby, M.: Approximating the permanent of graphs with large factors. Theor. Comput. Sci.\u00a0102, 283\u2013305 (1992)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1002\/jgt.3190150508","volume":"15","author":"D. Ding","year":"1991","unstructured":"Ding, D.: Covering the edges with consecutive sets. J. Graph Theory\u00a015, 559\u2013562 (1991)","journal-title":"J. Graph Theory"},{"key":"26_CR6","first-page":"1664","volume":"2","author":"M.E. Fisher","year":"1961","unstructured":"Fisher, M.E.: Statistical mechanics of dimers on a plane lattice. Phys. Rev. Ser. 2 124, 1664\u20131672 (1961)","journal-title":"Phys. Rev. Ser."},{"key":"26_CR7","first-page":"283","volume":"29","author":"H. Frost","year":"1990","unstructured":"Frost, H., Jacobson, M., Kabell, J., Morris, F.R.: Bipartite analogues of split graphs and related topics. Ars Comb.\u00a029, 283\u2013288 (1990)","journal-title":"Ars Comb."},{"key":"26_CR8","first-page":"19","volume":"6","author":"A. Galluccio","year":"1999","unstructured":"Galluccio, A., Loebl, M.: On the theory of Pfaffian orientations I. Perfect matchings and permanents. Electr. J. Comb. 6, Research Paper 6, 19 pages (1999)","journal-title":"Electr. J. Comb. 6, Research Paper"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1142\/S0129054100000260","volume":"11","author":"M.C. Golumbic","year":"2000","unstructured":"Golumbic, M.C., Rotics, U.: On the clique-width of some perfect graph classes. Internat. J. Found. Comput. Sci.\u00a011, 423\u2013443 (2000)","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0166-218X(90)90092-Q","volume":"28","author":"P.L. Hammer","year":"1990","unstructured":"Hammer, P.L., Peled, U.N., Sun, X.: Difference graphs. Discr. Appl. Math.\u00a028, 35\u201344 (1990)","journal-title":"Discr. Appl. Math."},{"key":"26_CR11","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1063\/1.1703953","volume":"4","author":"P.W. Kasteleyn","year":"1963","unstructured":"Kasteleyn, P.W.: Dimer statistics and phase transitions. J. Math. Phys.\u00a04, 287\u2013293 (1963)","journal-title":"J. Math. Phys."},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/S0020-0190(98)00173-2","volume":"68","author":"T. Kloks","year":"1998","unstructured":"Kloks, T., Kratsch, D., M\u00fcller, H.: Bandwidth of chain graphs. Infor. Proc. Lett.\u00a068, 313\u2013315 (1998)","journal-title":"Infor. Proc. Lett."},{"key":"26_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/11917496_18","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"J.A. Makowsky","year":"2006","unstructured":"Makowsky, J.A., Rotics, U., Averbouch, I., Godlin, B.: Computing graph polynomials on graphs of bounded clique-width. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol.\u00a04271, pp. 191\u2013204. Springer, Heidelberg (2006)"},{"key":"26_CR14","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.ipl.2006.12.002","volume":"102","author":"M.-S. Lin","year":"2007","unstructured":"Lin, M.-S.: Fast and simple algorithms to count the number of vertex covers in an interval graph. Infor. Proc. Lett.\u00a0102, 143\u2013146 (2007)","journal-title":"Infor. Proc. Lett."},{"key":"26_CR15","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/j.ipl.2008.03.008","volume":"107","author":"M.-S. Lin","year":"2008","unstructured":"Lin, M.-S., Chen, Y.-J.: Linear time algorithms for counting the number of minimal vertex covers with minimum\/maximum size in an interval graph. Infor. Proc. Lett.\u00a0107, 257\u2013264 (2008)","journal-title":"Infor. Proc. Lett."},{"key":"26_CR16","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.jda.2006.07.006","volume":"6","author":"Y. Okamoto","year":"2008","unstructured":"Okamoto, Y., Uno, T., Uehara, R.: Counting the independent sets in a chordal graph. J. Discr. Algor.\u00a06, 229\u2013242 (2008)","journal-title":"J. Discr. Algor."},{"key":"26_CR17","doi-asserted-by":"crossref","first-page":"1061","DOI":"10.1080\/14786436108243366","volume":"6","author":"H.N.V. Temperley","year":"1961","unstructured":"Temperley, H.N.V., Fisher, M.E.: Dimer problem in statistical mechanics \u2014 an exact result. Phil. Magazine, Ser. 8\u00a06, 1061\u20131063 (1961)","journal-title":"Phil. Magazine, Ser. 8"},{"key":"26_CR18","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1006\/jctb.1999.1941","volume":"78","author":"G. Tesler","year":"2000","unstructured":"Tesler, G.: Matchings in graphs on non-orientable surfaces. J. Comb. Theory, Ser. B\u00a078, 198\u2013231 (2000)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"26_CR19","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1137\/S0097539797321602","volume":"31","author":"S.P. Vadhan","year":"2001","unstructured":"Vadhan, S.P.: The complexity of counting in sparse, regular, and planar graphs. SIAM J. Comput.\u00a031, 398\u2013427 (2001)","journal-title":"SIAM J. Comput."},{"key":"26_CR20","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1142\/S0129054107005054","volume":"18","author":"R. Uehara","year":"2007","unstructured":"Uehara, R., Uno, Y.: On computing longest paths in small graph classes. Internat. J. Found. Comput. Sci.\u00a018, 911\u2013930 (2007)","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"26_CR21","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of computing the permanent. Theor. Comput. Sci.\u00a08, 189\u2013201 (1979)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR22","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM J. Comput.\u00a08, 410\u2013421 (1979)","journal-title":"SIAM J. Comput."},{"key":"26_CR23","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1137\/0210022","volume":"10","author":"M. Yannakakis","year":"1981","unstructured":"Yannakakis, M.: Node-deletion problems on bipartite graphs. SIAM J. Comput.\u00a010, 310\u2013327 (1981)","journal-title":"SIAM J. Comput."}],"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\/978-3-642-11409-0_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:52:03Z","timestamp":1619783523000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11409-0_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114083","9783642114090"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11409-0_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}