If true, the following conjecture of Thomassen [Th81] is a planarity criterion for a special class of graphs that involves only K 5. Recall that a planar graph on n vertices contains at most 3n-6 ...

Graph partitioning and bisection represent fundamental questions in combinatorial optimisation, concerned with dividing the vertices of a graph into disjoint subsets while balancing size constraints ...