{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T00:08:14Z","timestamp":1783901294196,"version":"3.55.0"},"reference-count":11,"publisher":"Walter de Gruyter GmbH","issue":"4","license":[{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-sa\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,12,1]]},"abstract":"<jats:title>Summary<\/jats:title>\n                  <jats:p>In this article the sum (or disjoint union) of graphs is formalized in the Mizar system [4], [1], based on the formalization of graphs in [9].<\/jats:p>","DOI":"10.2478\/forma-2021-0023","type":"journal-article","created":{"date-parts":[[2022,7,9]],"date-time":"2022-07-09T16:34:37Z","timestamp":1657384477000},"page":"249-278","source":"Crossref","is-referenced-by-count":2,"title":["About Graph Sums"],"prefix":"10.2478","volume":"29","author":[{"given":"Sebastian","family":"Koch","sequence":"first","affiliation":[{"name":"Johannes Gutenberg University Mainz , Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"374","published-online":{"date-parts":[[2022,7,9]]},"reference":[{"key":"2026071215073985941_j_forma-2021-0023_ref_001","doi-asserted-by":"crossref","unstructured":"[1] Grzegorz Bancerek, Czes\u0142aw Byli\u0144ski, Adam Grabowski, Artur Korni\u0142owicz, Roman Matuszewski, Adam Naumowicz, and Karol P\u0105k. The role of the Mizar Mathematical Library for interactive proof development in Mizar. Journal of Automated Reasoning, 61(1):9\u201332, 2018. doi:10.1007\/s10817-017-9440-6.604425130069070","DOI":"10.1007\/s10817-017-9440-6"},{"key":"2026071215073985941_j_forma-2021-0023_ref_002","unstructured":"[2] John Adrian Bondy and U. S. R. Murty. Graph Theory. Graduate Texts in Mathematics, 244. Springer, New York, 2008. ISBN 978-1-84628-969-9."},{"key":"2026071215073985941_j_forma-2021-0023_ref_003","unstructured":"[3] Reinhard Diestel. Graph theory. Graduate Texts in Mathematics; 173. Springer, New York, 2nd edition, 2000. ISBN 0-387-98976-5; 0-387-98976-5."},{"key":"2026071215073985941_j_forma-2021-0023_ref_004","doi-asserted-by":"crossref","unstructured":"[4] Adam Grabowski, Artur Korni\u0142owicz, and Adam Naumowicz. Four decades of Mizar. Journal of Automated Reasoning, 55(3):191\u2013198, 2015. doi:10.1007\/s10817-015-9345-1.","DOI":"10.1007\/s10817-015-9345-1"},{"key":"2026071215073985941_j_forma-2021-0023_ref_005","doi-asserted-by":"crossref","unstructured":"[5] Sebastian Koch. Miscellaneous graph preliminaries. Formalized Mathematics, 28(1):23\u201339, 2020. doi:10.2478\/forma-2020-0003.","DOI":"10.2478\/forma-2020-0003"},{"key":"2026071215073985941_j_forma-2021-0023_ref_006","doi-asserted-by":"crossref","unstructured":"[6] Sebastian Koch. Miscellaneous graph preliminaries. Part I. Formalized Mathematics, 29 (1):21\u201338, 2021. doi:10.2478\/forma-2021-0003.","DOI":"10.2478\/forma-2021-0003"},{"key":"2026071215073985941_j_forma-2021-0023_ref_007","doi-asserted-by":"crossref","unstructured":"[7] Sebastian Koch. About graph unions and intersections. Formalized Mathematics, 28(2): 155\u2013171, 2020. doi:10.2478\/forma-2020-0014.","DOI":"10.2478\/forma-2020-0014"},{"key":"2026071215073985941_j_forma-2021-0023_ref_008","unstructured":"[8] Gilbert Lee. Walks in graphs. Formalized Mathematics, 13(2):253\u2013269, 2005."},{"key":"2026071215073985941_j_forma-2021-0023_ref_009","unstructured":"[9] Gilbert Lee and Piotr Rudnicki. Alternative graph structures. Formalized Mathematics, 13(2):235\u2013252, 2005."},{"key":"2026071215073985941_j_forma-2021-0023_ref_010","unstructured":"[10] Kenneth H. Rosen, editor. Handbook of discrete and combinatorial mathematics. Discrete mathematics and its applications. CRC Press, Boca Raton, second edition, 2018. ISBN 978-1-58488-780-5."},{"key":"2026071215073985941_j_forma-2021-0023_ref_011","unstructured":"[11] Klaus Wagner. Graphentheorie. B.I-Hochschultaschenb\u00fccher; 248. Bibliograph. Inst., Mannheim, 1970. ISBN 3-411-00248-4."}],"container-title":["Formalized Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/reference-global.com\/pdf\/10.2478\/forma-2021-0023","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,12]],"date-time":"2026-07-12T23:22:05Z","timestamp":1783898525000},"score":1,"resource":{"primary":{"URL":"https:\/\/reference-global.com\/article\/10.2478\/forma-2021-0023"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,1]]},"references-count":11,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2022,7,9]]},"published-print":{"date-parts":[[2021,12,1]]}},"alternative-id":["10.2478\/forma-2021-0023"],"URL":"https:\/\/doi.org\/10.2478\/forma-2021-0023","relation":{},"ISSN":["1898-9934"],"issn-type":[{"value":"1898-9934","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,12,1]]}}}