{"type":"standard","title":"2023 Super Formula Lights","displaytitle":"2023 Super Formula Lights","namespace":{"id":0,"text":""},"wikibase_item":"Q115532094","titles":{"canonical":"2023_Super_Formula_Lights","normalized":"2023 Super Formula Lights","display":"2023 Super Formula Lights"},"pageid":72345029,"thumbnail":{"source":"https://upload.wikimedia.org/wikipedia/commons/thumb/1/1b/SFL_FUJI.jpg/330px-SFL_FUJI.jpg","width":320,"height":308},"originalimage":{"source":"https://upload.wikimedia.org/wikipedia/commons/1/1b/SFL_FUJI.jpg","width":520,"height":500},"lang":"en","dir":"ltr","revision":"1279878634","tid":"ea4e19d6-fe25-11ef-b7d6-c7ba1328d16d","timestamp":"2025-03-11T03:07:07Z","description":"Formula racing championship","description_source":"local","content_urls":{"desktop":{"page":"https://en.wikipedia.org/wiki/2023_Super_Formula_Lights","revisions":"https://en.wikipedia.org/wiki/2023_Super_Formula_Lights?action=history","edit":"https://en.wikipedia.org/wiki/2023_Super_Formula_Lights?action=edit","talk":"https://en.wikipedia.org/wiki/Talk:2023_Super_Formula_Lights"},"mobile":{"page":"https://en.m.wikipedia.org/wiki/2023_Super_Formula_Lights","revisions":"https://en.m.wikipedia.org/wiki/Special:History/2023_Super_Formula_Lights","edit":"https://en.m.wikipedia.org/wiki/2023_Super_Formula_Lights?action=edit","talk":"https://en.m.wikipedia.org/wiki/Talk:2023_Super_Formula_Lights"}},"extract":"The 2023 Super Formula Lights Championship was the fourth Super Formula Lights Championship season, after the Japanese Formula 3 Championship was rebranded following the end of the 2019 season. It featured drivers competing in Dallara 320 chassis and with engines made by three different manufacturers, a similar regulation format to the Euroformula Open Championship.","extract_html":"
The 2023 Super Formula Lights Championship was the fourth Super Formula Lights Championship season, after the Japanese Formula 3 Championship was rebranded following the end of the 2019 season. It featured drivers competing in Dallara 320 chassis and with engines made by three different manufacturers, a similar regulation format to the Euroformula Open Championship.
"}{"fact":"Some Siamese cats appear cross-eyed because the nerves from the left side of the brain go to mostly the right eye and the nerves from the right side of the brain go mostly to the left eye. This causes some double vision, which the cat tries to correct by \u201ccrossing\u201d its eyes.","length":275}
{"type":"standard","title":"Dual graph","displaytitle":"Dual graph","namespace":{"id":0,"text":""},"wikibase_item":"Q2294516","titles":{"canonical":"Dual_graph","normalized":"Dual graph","display":"Dual graph"},"pageid":2536864,"thumbnail":{"source":"https://upload.wikimedia.org/wikipedia/commons/thumb/b/ba/Duals_graphs.svg/320px-Duals_graphs.svg.png","width":320,"height":228},"originalimage":{"source":"https://upload.wikimedia.org/wikipedia/commons/thumb/b/ba/Duals_graphs.svg/313px-Duals_graphs.svg.png","width":313,"height":223},"lang":"en","dir":"ltr","revision":"1283677333","tid":"e37b7034-1020-11f0-94f6-5619724bb761","timestamp":"2025-04-03T00:16:29Z","description":"Graph representing faces of another graph","description_source":"local","content_urls":{"desktop":{"page":"https://en.wikipedia.org/wiki/Dual_graph","revisions":"https://en.wikipedia.org/wiki/Dual_graph?action=history","edit":"https://en.wikipedia.org/wiki/Dual_graph?action=edit","talk":"https://en.wikipedia.org/wiki/Talk:Dual_graph"},"mobile":{"page":"https://en.m.wikipedia.org/wiki/Dual_graph","revisions":"https://en.m.wikipedia.org/wiki/Special:History/Dual_graph","edit":"https://en.m.wikipedia.org/wiki/Dual_graph?action=edit","talk":"https://en.m.wikipedia.org/wiki/Talk:Dual_graph"}},"extract":"In the mathematical discipline of graph theory, the dual graph of a planar graph G is a graph that has a vertex for each face of G. The dual graph has an edge for each pair of faces in G that are separated from each other by an edge, and a self-loop when the same face appears on both sides of an edge. Thus, each edge e of G has a corresponding dual edge, whose endpoints are the dual vertices corresponding to the faces on either side of e. The definition of the dual depends on the choice of embedding of the graph G, so it is a property of plane graphs rather than planar graphs. For planar graphs generally, there may be multiple dual graphs, depending on the choice of planar embedding of the graph.","extract_html":"
In the mathematical discipline of graph theory, the dual graph of a planar graph G is a graph that has a vertex for each face of G. The dual graph has an edge for each pair of faces in G that are separated from each other by an edge, and a self-loop when the same face appears on both sides of an edge. Thus, each edge e of G has a corresponding dual edge, whose endpoints are the dual vertices corresponding to the faces on either side of e. The definition of the dual depends on the choice of embedding of the graph G, so it is a property of plane graphs rather than planar graphs. For planar graphs generally, there may be multiple dual graphs, depending on the choice of planar embedding of the graph.
"}