| Article ID: | iaor20052278 |
| Country: | Belarus |
| Volume: | 48 |
| Issue: | 5 |
| Start Page Number: | 5 |
| End Page Number: | 8 |
| Publication Date: | Sep 2004 |
| Journal: | Doklady of the National Academy of Sciences of Belarus |
| Authors: | Benediktovich V.I. |
It is proved that in arbitrary simple topological graph K3,3 there is always the non-crossing perfect matching. Using this fact, the more generalized conjecture of N. Dean that the planar subdivision of any drawing of the complete graph Kn (n 3 4) as a simple topological graph in the plane is necessarily 3-connected has been confirmed.