{"entities":{"Q2913047":{"pageid":2923772,"ns":120,"title":"Item:Q2913047","lastrevid":85079066,"modified":"2026-06-03T05:48:18Z","type":"item","id":"Q2913047","labels":{"en":{"language":"en","value":"A linear algorithm for constructing a Hamiltonian cycle in a locally connected graph of a triangular lattice"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 6086480"}},"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":"Q2913047$438D752F-C90A-44EC-A5C8-8B1F9CE4918C","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"110862ab25b38b5290afed7b5cd4431c16a4ae7c","datavalue":{"value":"1247.05245","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2913047$E21E1AC6-6854-418B-B59B-D0370000177F","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"b1bb2cd062e255e2c58766b0d5895916f671a9b0","datavalue":{"value":{"entity-type":"item","numeric-id":2913046,"id":"Q2913046"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2913047$C4BF6A03-04A6-4719-962F-A05CF9F49664","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"e6b00aac43a8308ba24a0697ff1b19387c2c0656","datavalue":{"value":{"time":"+2012-09-25T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2913047$D348E1BC-02D6-4BA1-9312-B17609231F31","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"749b7137f279a66a306e75e15f613231b281c1c5","datavalue":{"value":"05C85","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2913047$0E3DE7F9-7436-410B-95A2-B4443EB8851B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"eef1b49f4a66afb755b22d7419db9d61ba07415f","datavalue":{"value":"05C45","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2913047$D6A358F3-49E2-461C-B203-DBC7E133F2E1","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"0fabc1f2c3e6200af15be64201bb0ca77d9506f7","datavalue":{"value":"6086480","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2913047$659EB300-702B-4897-9A53-9214875DC78D","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":"Q2913047$A69F8B6F-6988-4EAC-AE8E-44F2149F438A","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"0f53f8e932eaba88a9dccee9ca8dd746cdac4e2a","datavalue":{"value":{"text":"A linear algorithm for constructing a Hamiltonian cycle in a locally connected graph of a triangular lattice","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2913047$49E13111-B49E-4B59-813F-76875CC6B071","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"54f375722052571439473e1d9c03b079911890d6","datavalue":{"value":{"entity-type":"item","numeric-id":6769235,"id":"Q6769235"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2913047$C879C5DF-5670-4912-8B81-FFDE380305A5","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A linear algorithm for constructing a Hamiltonian cycle in a locally connected graph of a triangular lattice","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_linear_algorithm_for_constructing_a_Hamiltonian_cycle_in_a_locally_connected_graph_of_a_triangular_lattice"}}}}}