|
|||||
|
|
Even circuits in planar graphs |
|
| Authors: | P.D Seymour |
| Affiliation: | Merton College, Oxford, England |
| Abstract: | We prove that a planar graph can be partitioned into edge-disjoint circuits of even length, if and only if every vertex has even valency and every block has an even number of edges. |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |