Kuratowski's theorem
On forbidden subgraphs in planar graphs
In graph theory, Kuratowski's theorem is a mathematical forbidden graph characterization of planar graphs, named after Kazimierz Kuratowski.
ATK 3292DEF 5083
On forbidden subgraphs in planar graphs
In graph theory, Kuratowski's theorem is a mathematical forbidden graph characterization of planar graphs, named after Kazimierz Kuratowski.
On forbidden subgraphs in planar graphs
Nobody has pulled this card yet. The first copy makes you its discoverer.
In graph theory, Kuratowski's theorem is a mathematical forbidden graph characterization of planar graphs, named after Kazimierz Kuratowski. It states that a finite graph is planar if and only if it does not contain a subgraph that is a subdivision of nor of .
No sale yet.
None on the Market right now.