{"entities":{"Q1872891":{"pageid":1883633,"ns":120,"title":"Item:Q1872891","lastrevid":71027487,"modified":"2026-04-13T19:00:40Z","type":"item","id":"Q1872891","labels":{"en":{"language":"en","value":"Small universal graphs for bounded-degree planar graphs"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1912032"}},"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":"Q1872891$7BB36FB9-A42D-41EA-8BE5-61F9F987577E","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"852f2ab67ed45423f004f7c1560c444c0f118911","datavalue":{"value":{"text":"Small universal graphs for bounded-degree planar graphs","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1872891$39D77C1A-A11D-4A1D-9D36-3CC844E7CBCF","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"c503c41ebd1163e9fca66b8269f64ae116e00995","datavalue":{"value":"1012.05093","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1872891$C316FEDD-CD77-4981-862D-5E510F692E5A","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"71da963f870a561d621046b2c1303bd2c34f0294","datavalue":{"value":{"entity-type":"item","numeric-id":1872890,"id":"Q1872890"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1872891$2D838180-0EE8-4425-A634-0A236F444974","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"a87e84d22579e69c48ca0a6d828473db4dde3dd6","datavalue":{"value":{"entity-type":"item","numeric-id":168579,"id":"Q168579"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1872891$04D4AC8B-35B0-485B-A9E1-C60778082CC9","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"ac971e8cb2e612158aa117d6bf54118d33f6ff02","datavalue":{"value":{"time":"+2003-05-18T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1872891$574CEB9E-EC83-488D-AB7A-C16F46C049F3","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"c0e478113778879718d56674e94e5d6a29f99d7b","datavalue":{"value":"If \\(N\\), \\(k\\) are natural numbers, a graph on \\(O_k(N)\\) vertices is explicitly constructed that embeds every \\(N\\)-vertex planar graph with maximum degree \\(\\leq k\\).","type":"string"},"datatype":"string"},"type":"statement","id":"Q1872891$0C4FC816-7DCA-4C1A-8616-EED8A5FF758B","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"5a3bb76dbd41580d9287ece5137de80ddf22202f","datavalue":{"value":"05C35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1872891$027EDBE2-456A-4F44-9A89-CE749F0C6615","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"9413893625b725fdd5239e5582eda6fd6c3608fa","datavalue":{"value":"1912032","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1872891$7420347E-3CFB-4DDA-AFF4-44E0AFB8A61B","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"a602521768d4795b8ce801eaf970fa00075370dd","datavalue":{"value":"planar graphs","type":"string"},"datatype":"string"},"type":"statement","id":"Q1872891$7BCFC4AA-5109-4C84-9693-60710C0BAA3F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e86d9b4ad5a06064fd9c9bcbc50f8026b1c776dc","datavalue":{"value":"embedding","type":"string"},"datatype":"string"},"type":"statement","id":"Q1872891$E8A4352E-0057-4107-83D4-8EA52FE820DB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0992f286bbd6271f13708374336765be35d2cde0","datavalue":{"value":"universal graphs","type":"string"},"datatype":"string"},"type":"statement","id":"Q1872891$83EC753C-F64F-4EA9-B5A1-47E39CC8238D","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"826db22c8ad0fdc537525e95eba03f39da931f90","datavalue":{"value":{"entity-type":"item","numeric-id":178041,"id":"Q178041"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1872891$6847B609-229C-4FB2-B434-CB06F959F5EA","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":"Q1872891$C1E0DD72-84C3-4DD2-B931-A99B75427D1C","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"c04af1129e680026d107335f67bfbe96443892f0","datavalue":{"value":"https://doi.org/10.1007/s004930200017","type":"string"},"datatype":"url"},"type":"statement","id":"Q1872891$24E13AFE-6BD2-49AF-B562-B67C12DB228C","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"1e5748c912bf7bef3aac1bca3d27c8990b62b80e","datavalue":{"value":"W2087086535","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1872891$9DA2DB0A-D839-4EB8-B22A-5183A5913415","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"515fbe3d0c818cf2d0ce1adc90a083987910c046","datavalue":{"value":"10.1007/S004930200017","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1872891$CC538A40-C0D5-472C-B855-50CF0BB8F627","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Small universal graphs for bounded-degree planar graphs","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Small_universal_graphs_for_bounded-degree_planar_graphs"}}}}}