摘要
This paper shows a graph partition problem pblynomially solvable. Moreover, the problemin the planar case leads to a number of problems in graphs and combinatorial optimisationspolynomially solvable.
This paper shows a graph partition problem pblynomially solvable. Moreover, the problemin the planar case leads to a number of problems in graphs and combinatorial optimisationspolynomially solvable.
