{"entities":{"Q5922778":{"pageid":8056099,"ns":120,"title":"Item:Q5922778","lastrevid":97623386,"modified":"2026-06-05T15:06:49Z","type":"item","id":"Q5922778","labels":{"en":{"language":"en","value":"A combinatorial condition for planar graphs."}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 2521425"}},"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":"Q5922778$18285FDD-FCE4-4038-819C-C4E3EB2FA920","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"85586d6ab74e4df0f9299ed36434ccf5ee1a2512","datavalue":{"value":{"text":"A combinatorial condition for planar graphs.","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q5922778$4DB96900-F6C8-4405-8912-5E618923E62B","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"8676505a0288ce9ed37c2158d275641f965bbe2a","datavalue":{"value":"63.0548.01","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5922778$BF6550DA-A8D2-4D12-9E4B-0EC33F382182","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"5797d223f34682fa810388331056bbf163f31972","datavalue":{"value":{"entity-type":"item","numeric-id":559381,"id":"Q559381"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5922778$2D509CDE-0852-4EFF-A2B6-89502569F37F","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"4b5727a7c5b8fd0294ba23bb629bc28c096c780c","datavalue":{"value":{"time":"+1937-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":"Q5922778$24FEF172-703D-4776-96EA-74169F686CEE","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"91457cc5a87649e47fe03f13bd5bfa71694670d7","datavalue":{"value":"https://eudml.org/doc/212919","type":"string"},"datatype":"url"},"type":"statement","id":"Q5922778$A4ABE97B-3866-4394-A074-43F9FE3B7A26","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"65529a1116746714afb522a3a84310ef7e254538","datavalue":{"value":"Verf. kennzeichnet die Graphen, die (singularit\u00e4tenfrei) in die Ebene eingebettet werden k\u00f6nnen, folgenderma\u00dfen: Dann und nur dann ist ein Graph planar, wenn er eine solche Basis der Kreise besitzt (``zweifache Basis''), da\u00df keine seiner Strecken in mehr als zwei Kreisen der Basis auftritt. (Kreis \\(=\\) einfach geschlossener Streckenzug; Basis \\(\\mod 2\\) genommen.) Zum Beweis kann man sich auf nicht-separable Graphen beschr\u00e4nken. F\u00fcr einen nicht-separablen Graphen -- in die Ebene eingebettet -liefern offenbar die Grenzen der beschr\u00e4nkten Gebiete eine zweifache Basis der Kreise, und umgekehrt zeigt Verf., da\u00df jeder derartigen Basis eine Einbettung des Graphen in die Ebene entspricht, bei der die Basiskreise Grenzen der beschr\u00e4nkten Gebiete werden; das geschieht durch einen Induktionsschlu\u00df nach der Nullit\u00e4t des Graphen.  Schlie\u00dflich zeigt Verf. auf kombinatorischem Wege, da\u00df sein Kriterium mit der von \\textit{Whitney} (Trans. Amer. math. Soc. 34 (1932), 339-362; JFM 58.0608.*) gefundenen Bedingung der Existenz des (kombinatorisch) dualen Graphen gleichwertig ist. Der \u00dcbergang von der Existenz einer zweifachen Basis der Kreise zum dualen Graphen erfolgt z. B. dadurch, da\u00df man jedem Kreis der Basis eine Ecke, zwei Kreisen, die eine Strecke gemeinsam haben, die Verbindung der entsprechenden Ecken zuordnet.","type":"string"},"datatype":"string"},"type":"statement","id":"Q5922778$D3AB3E21-2ABE-43BD-8541-41A68B7A87F0","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"144a6eebf639ea543bd03fa2e7064384b1e7bf2e","datavalue":{"value":{"entity-type":"item","numeric-id":593326,"id":"Q593326"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5922778$8A2F8024-A14C-48A2-88E2-E156E3A6A1AC","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"c4eea975e5706bb84abecfcb4c1ee716d6e47bd7","datavalue":{"value":"2521425","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5922778$07181F13-E552-4345-A15A-61C3D6309AAA","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":"Q5922778$D7E97053-DCF3-4311-9C69-D1A496085EAC","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"0ff273696cf145c845f3a4b793d5bb0167aefefa","datavalue":{"value":{"entity-type":"item","numeric-id":6481445,"id":"Q6481445"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5922778$E70707DA-6218-421D-A69A-E5E5E46A6AA2","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A combinatorial condition for planar graphs.","badges":[]}}}}}