{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T10:10:57Z","timestamp":1768817457073,"version":"3.49.0"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,10,26]],"date-time":"2020-10-26T00:00:00Z","timestamp":1603670400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,10,26]],"date-time":"2020-10-26T00:00:00Z","timestamp":1603670400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1851842"],"award-info":[{"award-number":["DMS-1851842"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1007\/s00373-020-02240-2","type":"journal-article","created":{"date-parts":[[2020,10,26]],"date-time":"2020-10-26T12:03:10Z","timestamp":1603713790000},"page":"241-261","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Counting Locally Flat-Foldable Origami Configurations Via 3-Coloring Graphs"],"prefix":"10.1007","volume":"37","author":[{"given":"Alvin","family":"Chiu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William","family":"Hoganson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3215-9767","authenticated-orcid":false,"given":"Thomas C.","family":"Hull","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sylvia","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,26]]},"reference":[{"key":"2240_CR1","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-319-48532-4_15","volume-title":"Discrete and Computational Geometry and Graphs","author":"HA Akitaya","year":"2016","unstructured":"Akitaya, H.A., Cheung, K.C., Demaine, E.D., Horiyama, T., Hull, T.C., Ku, J.S., Tachi, T., Uehara, R.: Box pleating is hard. In: Akiyama, J., Ito, H., Sakai, T., Uno, Y. (eds.) Discrete and Computational Geometry and Graphs, pp. 167\u2013179. Springer, Cham (2016)"},{"key":"2240_CR2","doi-asserted-by":"publisher","first-page":"032112","DOI":"10.1103\/PhysRevE.98.032112","volume":"98","author":"M Assis","year":"2018","unstructured":"Assis, M.: Exactly solvable flat-foldable quadrilateral origami tilings. Phys. Rev. E 98, 032112 (2018). https:\/\/doi.org\/10.1103\/PhysRevE.98.032112","journal-title":"Phys. Rev. E"},{"key":"2240_CR3","unstructured":"Bern, M., Hayes, B.: The complexity of flat origami. In: Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, Philadelphia, pp. 175\u2013183 (1996)"},{"key":"2240_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511735172","volume-title":"Geometric Folding Algorithms: Linkages, Origami. Polyhedra","author":"ED Demaine","year":"2007","unstructured":"Demaine, E.D., O\u2019Rourke, J.: Geometric Folding Algorithms: Linkages, Origami. Polyhedra. Cambridge University Press, Cambridge (2007)"},{"issue":"9","key":"2240_CR5","doi-asserted-by":"publisher","first-page":"150067","DOI":"10.1098\/rsos.150067","volume":"2","author":"TA Evans","year":"2015","unstructured":"Evans, T.A., Lang, R.J., Magleby, S.P., Howell, L.L.: Rigidly foldable origami gadgets and tessellations. R. Soc. Open Sci. 2(9), 150067 (2015). https:\/\/doi.org\/10.1098\/rsos.150067","journal-title":"R. Soc. Open Sci."},{"key":"2240_CR6","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1090\/S0273-0979-00-00870-3","volume":"37","author":"PD Francesco","year":"2000","unstructured":"Francesco, P.D.: Folding and coloring problems in mathematics and physics. Bull. Am. Math. Soc. 37, 251\u2013307 (2000)","journal-title":"Bull. Am. Math. Soc."},{"key":"2240_CR7","unstructured":"Ginepro, J., Hull, T.C.: Counting Miura-ori foldings. J. Integer Seq. 17(10), Article 14.10.8 (2014)"},{"key":"2240_CR8","unstructured":"Hull, T.C.: The combinatorics of flat folds: a survey. In: Origami$$^3$$: Third International Meeting of Origami Science, Mathematics, and Education. A K Peters, Natick, pp. 29\u201338 (2002)"},{"key":"2240_CR9","first-page":"175","volume":"67","author":"TC Hull","year":"2003","unstructured":"Hull, T.C.: Counting mountain-valley assignments for flat folds. Ars Combinatoria 67, 175\u2013188 (2003)","journal-title":"Ars Combinatoria"},{"key":"2240_CR10","unstructured":"Mitani, J.: \n                  \n                \n\n\n (ORIPA) \n                  \n                \n\n\n (Development of origami pattern editor (ORIPA) and a method for estimating a folded configuration of origami from the crease cattern, in Japanese). \n                  \n                \n\n\n (Information Processing Society of Japan (IPSJ)) 48(9), 3309\u20133317 (2007)"},{"key":"2240_CR11","doi-asserted-by":"publisher","unstructured":"Ouchi, K., Uehara, R.: Efficient enumeration of flat-foldable single vertex crease patterns. IEICE Trans. Inf. Syst. E102.D(3), 416\u2013422 (2019). https:\/\/doi.org\/10.1587\/transinf.2018FCP0004","DOI":"10.1587\/transinf.2018FCP0004"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02240-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-020-02240-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02240-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T00:43:24Z","timestamp":1635209004000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-020-02240-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,26]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["2240"],"URL":"https:\/\/doi.org\/10.1007\/s00373-020-02240-2","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,26]]},"assertion":[{"value":"3 November 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 September 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 October 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 October 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with Ethical Standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}