Facts
Citation
URLhttps://en.wikipedia.org/wiki/Wagner%27s_theorem
Sources
Wagner's theorem - Wikipedia
Lead sectionQuote, Lead section
In graph theory, Wagner's theorem is a mathematical forbidden graph characterization of planar graphs, named after Klaus Wagner, stating that a finite graph is planar if and only if its minors include neither K5 (the complete graph on five vertices) nor K3,3 (the utility graph, a complete bipartite graph on six vertices).
Claims Backed By This Source (8 claims)
This source backs 8 claims across the atlas. As facts: 3 well-attested. As cited relationships: 3 holds. Plus 2 entities citing it as a general reference with no single fact or relationship attached.
Disposition By Topic
- Theorems, 7 claims: 2 well-attested, 3 holds, 2 general references.
- Sources, 1 claims: 1 well-attested.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.