Complements of nearly perfect graphs

A class of graphs closed under taking induced subgraphs is $\chi$-bounded if there exists a function $f$ such that for all graphs $G$ in the class, $\chi(G) \leq f(\omega(G))$. We consider the following question initially studied in [A. Gy{\'a}rf{\'a}s, Problems from the world surrounding perfect graphs, {\em Zastowania Matematyki Applicationes Mathematicae}, 19:413--441, 1987]. For a $\chi$-bounded class $\cal C$, is the class $\bar{C}$ $\chi$-bounded (where $\bar{\cal C}$ is the class of graphs formed by the complements of graphs from $\cal C$)? We show that if $\cal C$ is $\chi$-bounded by the constant function $f(x)=3$, then $\bar{\cal C}$ is $\chi$-bounded by $g(x)=\lfloor\frac{8}{5}x\rfloor$ and this is best possible. We show that for every constant $c>0$, if $\cal C$ is $\chi$-bounded by a function $f$ such that $f(x)=x$ for $x \geq c$, then $\bar{\cal C}$ is $\chi$-bounded. For every $j$, we construct a class of graphs $\chi$-bounded by $f(x)=x+x/\log^j(x)$ whose complement is not $\chi$-bounded

On self-complementation

We prove that, with very few exceptions, every graph of order n, n - 0, 1(mod 4) and size at most n - 1, is contained in a self-complementary graph of order n. We study a similar problem for digraphs

On the algorithmic complexity of twelve covering and independence parameters of graphs

The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to covering and independence, each of which has been studied previously in some form. Here we survey briefly results concerning total coverings and total matchings of graphs, and consider the aforementioned 12 covering and independence parameters with regard to algorithmic complexity. We survey briefly known results for several graph classes, and obtain new NP-completeness results for the minimum total cover and maximum minimal total cover problems in planar graphs, the minimum maximal total matching problem in bipartite and chordal graphs, and the minimum independent dominating set problem in planar cubic graphs

Internal Partitions of Regular Graphs

An internal partition of an $n$-vertex graph $G=(V,E)$ is a partition of $V$ such that every vertex has at least as many neighbors in its own part as in the other part. It has been conjectured that every $d$-regular graph with $n>N(d)$ vertices has an internal partition. Here we prove this for $d=6$. The case $d=n-4$ is of particular interest and leads to interesting new open problems on cubic graphs. We also provide new lower bounds on $N(d)$ and find new families of graphs with no internal partitions. Weighted versions of these problems are considered as well