{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T15:17:03Z","timestamp":1777475823024,"version":"3.51.4"},"reference-count":0,"publisher":"Walter de Gruyter GmbH","issue":"2","license":[{"start":{"date-parts":[[2014,6,30]],"date-time":"2014-06-30T00:00:00Z","timestamp":1404086400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-sa\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,6,30]]},"abstract":"<jats:title>Summary<\/jats:title>\n                  <jats:p>In this paper we account for the formalization of the seven bridges of K\u00f6nigsberg puzzle. The problem originally posed and solved by Euler in 1735 is historically notable for having laid the foundations of graph theory, cf. [7]. Our formalization utilizes a simple set-theoretical graph representation with four distinct sets for the graph\u2019s vertices and another seven sets that represent the edges (bridges). The work appends the article by Nakamura and Rudnicki [10] by introducing the classic example of a graph that does not contain an Eulerian path.<\/jats:p>\n                  <jats:p>This theorem is item #54 from the \u201cFormalizing 100 Theorems\u201d list maintained by Freek Wiedijk at http:\/\/www.cs.ru.nl\/F.Wiedijk\/100\/.<\/jats:p>","DOI":"10.2478\/forma-2014-0018","type":"journal-article","created":{"date-parts":[[2015,2,5]],"date-time":"2015-02-05T08:48:28Z","timestamp":1423126108000},"page":"177-178","source":"Crossref","is-referenced-by-count":3,"title":["A Note on the Seven Bridges of K\u00f6nigsberg Problem"],"prefix":"10.2478","volume":"22","author":[{"given":"Adam","family":"Naumowicz","sequence":"first","affiliation":[{"name":"Institute of Informatics University of Bia\u0142ystok Sosnowa 64, 15-887 Bia\u0142ystok Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"374","published-online":{"date-parts":[[2014,6,30]]},"container-title":["Formalized Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/content.sciendo.com\/view\/journals\/forma\/22\/2\/article-p177.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/reference-global.com\/pdf\/10.2478\/forma-2014-0018","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T13:54:17Z","timestamp":1777384457000},"score":1,"resource":{"primary":{"URL":"https:\/\/reference-global.com\/article\/10.2478\/forma-2014-0018"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,30]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2014,6,30]]},"published-print":{"date-parts":[[2014,6,30]]}},"alternative-id":["10.2478\/forma-2014-0018"],"URL":"https:\/\/doi.org\/10.2478\/forma-2014-0018","relation":{},"ISSN":["1898-9934"],"issn-type":[{"value":"1898-9934","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,30]]}}}