Properties of a planar cubic graph
β
Shunichi Toida
π
Article
π
1973
π
Elsevier Science
π
English
β 506 KB
It is shown that a planar can always be to planar graph fewer vertices. It is shown if a planar cubic graph is edge-3colorable then the reduction of the number of its vertices is possible without changing colors of its edges.