A graph is ( H 1 , H 2 )‐free for a pair of graphs H 1 , H 2 if it contains no induced subgraph isomorphic to H 1 or H 2. In 2001, Král et al initiated a study into the complexity of coloring for ( H 1 , H 2 )‐free graphs. Since then, others have tried to complete their study, but many cases remain open. We focus on those ( H 1 , H 2 )‐free graphs where H 2 is H true¯ 1, the complement of H 1. As these classes are closed under complementation, the computational complexities of coloring and clique cover coincide. By combining new and known results, we are able to classify the complexity of coloring and clique cover for ( H , trueH ¯ )‐free graphs for all cases except when H = s P 1 + P 3 for s ≥ 3 or H = s P 1 + P 4 for s ≥ 2. We also classify the complexity of coloring on graph classes characterized by forbidding a finite number of self‐complementary induced subgraphs, and we initiate a study of k‐ coloring for ( P r , P true¯ r )‐free graphs.

Clique-width is an important graph parameter due to its algorithmic and structural properties. A graph class is hereditary if it can be characterized by a (not necessarily finite) set H of forbidden induced subgraphs. We initiate a systematic study into the boundedness of cliquewidth of hereditary graph classes closed under complementation. First, we extend the known classification for the |H| = 1 case by classifying the boundedness of clique-width for every set H of self-complementary graphs. We then completely settle the |H| = 2 case. In particular, we determine one new class of (H, H)-free graphs of bounded clique-width (as a side effect, this leaves only six classes of (H 1 , H 2)-free graphs, for which it is not known whether their cliquewidth is bounded). Once we have obtained the classification of the |H| = 2 case, we research the effect of forbidding self-complementary graphs on the boundedness of clique-width. Surprisingly, we show that for a set F of self-complementary graphs on at least five vertices, the classification of the boundedness of clique-width for ({H, H} ∪ F)-free graphs coincides with the one for the |H| = 2 case if and only if F does not include the bull (the only non-empty self-complementary graphs on fewer than five vertices are P 1 and P 4 , and P 4-free graphs have clique-width at most 2). Finally, we discuss the consequences of our results for Colouring.

No abstract

Given a dominating set, how much smaller a dominating set can we find through elementary operations? Here, we proceed by iterative vertex addition and removal while maintaining the property that the set forms a dominating set of bounded size. This can be seen as the optimization variant of the dominating set reconfiguration problem, where two dominating sets are given and the question is merely whether they can be reached from one another through elementary operations. We show that this problem is PSPACE-complete, even if the input graph is a bipartite graph, a split graph, or has bounded pathwidth. On the positive side, we give linear-time algorithms for cographs, trees and interval graphs. We also study the parameterized complexity of this problem. More precisely, we show that the problem is W[2]-hard when parameterized by the upper bound on the size of an intermediary dominating set. On the other hand, we give fixed-parameter algorithms with respect to the minimum size of a vertex cover, or d + s where d is the degeneracy and s is the upper bound of the output solution.