Partitions of graphs and multigraphs under degree constraints (Q2181223)

Let \(a\) and \(b\) be nonnegative integers, let \(G\) be a loopless multigraph. Under what conditions the vertex set of \(G\) can be partitioned into \(A\) and \(B\) such that the minimum degree of the subgraph induced by \(A\) is at least \(a\) and the minimum degree of the subgraph induced by \(B\) is at least \(b\)? Motivated by a question of \textit{C. Thomassen} [J. Graph Theory 7, 165--167 (1983; Zbl 0515.05045)], the authors show that such a partition exists if \(G\) is simple with minumum degree at least \(a+b-1\) where \(a,b\geq 2\), and \(G\) does not have a subgraph isomorphic to four specific small graphs. Moreover, the authors show that such a partition exists if \(G\) has at least five vertices, has minumum degree at least \(a+b+2\mu-2\), and does not have a subgraph isomorphic to three specific small graphs. Here, \(\mu\) is the maximum edge multiplicity of \(G\).