{"entities":{"Q5563934":{"pageid":7593494,"ns":120,"title":"Item:Q5563934","lastrevid":101458067,"modified":"2026-06-06T01:20:23Z","type":"item","id":"Q5563934","labels":{"en":{"language":"en","value":"On the number of spanning trees of finite graphs"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3279783"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5563934$74E10E93-4E1D-4825-BFEE-0CD85069DE05","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"d0b7adc7b884c2820fd2415f30fe7ab634b0e3ed","datavalue":{"value":"0175.20902","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5563934$F0C0948B-0012-48F8-99BB-145E8130598C","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"5b39197a61e4e264be560f5faa1f688ea03f4064","datavalue":{"value":{"entity-type":"item","numeric-id":791546,"id":"Q791546"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5563934$60E2FDE9-B128-4E6D-83EF-B9EFF1F40600","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"b7ebb271ba779bdc18e731b88d6d6d8739d7e37f","datavalue":{"value":{"time":"+1969-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q5563934$F925A975-3831-43B7-85D5-C4BC9964024E","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"fc79a4c35ffa1fba9e3968c5b9b719e25fa8a59b","datavalue":{"value":"https://eudml.org/doc/21020","type":"string"},"datatype":"url"},"type":"statement","id":"Q5563934$41C426D3-4085-4539-9F86-5D82E8958FFE","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"6f7f437a3d2c5d58865ab2428d4db25f451ebeb7","datavalue":{"value":"3279783","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5563934$6898774A-2B56-4B91-A9F8-0472BDE1FECA","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"96a810129b114a6942442a7fc510c6873bd89ff8","datavalue":{"value":"topology","type":"string"},"datatype":"string"},"type":"statement","id":"Q5563934$CF556223-7728-4642-8BEB-EFA6CDD01E50","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5563934$73610D71-3E0F-4367-B088-19DCCA32C31A","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"4f4fd8e6fa578aa5cd2c25ad03073acbb4cdc7c6","datavalue":{"value":"W3048181327","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5563934$92CBD65C-EA72-4A2D-AE7D-C45C2521AFD4","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"6fa6bdb127ec66a190a2de1baa9a4bf52a561577","datavalue":{"value":{"text":"On the number of spanning trees of finite graphs","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q5563934$3979B3EA-A6AD-430D-B963-D8F6D13EDBA7","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"bad29b03eb84feaaf4e1add7a285d3c14e0df110","datavalue":{"value":"10.21136/CPM.1969.117654","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5563934$52CA855E-9B82-4137-83B2-1CDE7446E7CA","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"On the number of spanning trees of finite graphs","badges":[]}}}}}