{"entities":{"Q6380386":{"pageid":13514073,"ns":120,"title":"Item:Q6380386","lastrevid":99509762,"modified":"2026-06-05T20:07:19Z","type":"item","id":"Q6380386","labels":{"en":{"language":"en","value":"Roman domination in graphs with minimum degree at least two and some forbidden cycles"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 900492556"}},"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":"Q6380386$A105B7CB-5FE8-4693-A14E-CCF9B5BE9474","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"ce6f9a40f2047907fcf71b3f07791fced1886358","datavalue":{"value":{"time":"+2021-10-14T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6380386$BE891F5F-2EF9-47EF-9ABE-8610EC30133C","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"e0bc7ecb6470044ffd4ba0182ffc72809f8010a9","datavalue":{"value":{"entity-type":"item","numeric-id":630191,"id":"Q630191"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6380386$8ADEBF42-BD23-45F6-99DA-3D3B934C9E5C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"99daa9c6ad6a7adc6aab5563d173fc645a1dbf2a","datavalue":{"value":{"entity-type":"item","numeric-id":251498,"id":"Q251498"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6380386$0ED7FE2F-292F-45DE-95AB-E9C4906A8DCC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"4fa2ebb30f8d97056d0373c8876f0cb3005bcbe6","datavalue":{"value":{"entity-type":"item","numeric-id":821313,"id":"Q821313"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6380386$320F087D-5116-4825-9F93-EFB8838842A8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"00f10dfc0172f5b92ce7926670a8a0dbac941b21","datavalue":{"value":{"entity-type":"item","numeric-id":630190,"id":"Q630190"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6380386$58CB4BE4-D24D-4256-81D6-6ED9010613B6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"278afd141c943c64f4cbb71c471b6812324eb1fe","datavalue":{"value":{"entity-type":"item","numeric-id":247872,"id":"Q247872"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6380386$EF7E9FE8-6B98-4D6D-BFE6-C1B3654127CF","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"cb1e2924ba238bc47b6e89cc71d65b0484b3d905","datavalue":{"value":"05C69","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6380386$76690CFF-4B12-4A4D-A374-A25C43C5B8AA","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"28f8e3d45d1e82476c0c564b72ffbb17b694fcd7","datavalue":{"value":"900492556","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6380386$E5BACE3D-AD78-4A39-845F-5866B80642E5","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":"Q6380386$F70D702F-AE61-47E7-A983-7A7C4708103F","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Roman domination in graphs with minimum degree at least two and some forbidden cycles","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Roman_domination_in_graphs_with_minimum_degree_at_least_two_and_some_forbidden_cycles"}}}}}