Template:Tesseract graph nonplanar visual proof.svg
From Vigyanwiki
Proof without words that a hypercube graph is non-planar using Kuratowski's or Wagner's theorems and finding either K5 (top) or K3,3 (bottom) subgraphs
Navigation
Wiki tools
Wiki tools
Page tools
Page tools
User page tools
Other projects
In other languages
Categories
Categories
- This page was last modified on 15 July 2023, at 10:31.
- Content is available under Creative Commons Attribution-ShareAlike unless otherwise noted.