Degree-constrained 2-partitions of graphs

Jørgen Bang-Jensen (1) , Stéphane Bessy (2)

1 IMADA - Department of Mathematics and Computer Science [Odense]
2 ALGCO - Algorithmes, Graphes et Combinatoire

A (δ ≥ k1, δ ≥ k2)-partition of a graph G is a vertex-partition (V1, V2) of G satisfying that δ(G[Vi]) ≥ ki for i = 1, 2. We determine, for all positive integers k1, k2, the complexity of deciding whether a given graph has a (δ ≥ k1, δ ≥ k2)-partition. We also address the problem of finding a function g(k1, k2) such that the (δ ≥ k1, δ ≥ k2)-partition problem is N P-complete for the class of graphs of minimum degree less than g(k1, k2) and polynomial for all graphs with minimum degree at least g(k1, k2). We prove that g(1, k) = k for k ≥ 3, that g(2, 2) = 3 and that g(2, 3), if it exists, has value 4 or 5.

Mots clés: N P-complete; Polynomial; 2-partition; Minimum degree

Domaines: Logique [math.LO]

Jørgen Bang-Jensen, Stéphane Bessy. Degree-constrained 2-partitions of graphs. Theoretical Computer Science, 2019, 776, pp.64-74. ⟨10.1016/j.tcs.2018.12.023⟩. ⟨lirmm-02011257⟩